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
new file mode 100644
index 000000000..deed0f9dd
--- /dev/null
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map
@@ -0,0 +1,5 @@
+
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
new file mode 100644
index 000000000..bce709bab
--- /dev/null
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5
@@ -0,0 +1 @@
+094ceb470fb68fee6019a398206ccea4
\ 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
new file mode 100644
index 000000000..9d6e441c7
--- /dev/null
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg
@@ -0,0 +1,66 @@
+
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.html b/d1/def/classdata__structures_1_1linked__list_1_1list.html
new file mode 100644
index 000000000..51a12134a
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html
@@ -0,0 +1,433 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures::linked_list::list Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::list Class Reference
+
+
+
+Collaboration diagram for data_structures::linked_list::list:
+
+
+
+[legend]
+
+
+Public Member Functions
list () bool isEmpty () void push_back (int new_elem) void push_front (int new_elem) void erase (int old_elem) void display () std::shared_ptr< link > search (int find_elem)
+void reverse ()
+
+Private Attributes
+std::shared_ptr< link > first link before the actual first element
+std::shared_ptr< link > last last link on the list
+Detailed Description
+A list class containing a sequence of links
+Constructor & Destructor Documentation
+
+◆ list()
+
+
+
+
+
+
+
+
+ data_structures::linked_list::list::list
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+Member Function Documentation
+
+◆ display()
+
+
+
+
+
+ void list::display
+ (
+ )
+
+
+
+function displays all the elements in the list
- Returns
- 'void'
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ erase()
+
+
+
+
+
+ void list::erase
+ (
+ int
+ old_elem )
+
+
+
+function erases old element from the list
- Parameters
-
+
+ old_elem to be erased from the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ isEmpty()
+
+
+
+
+
+ bool list::isEmpty
+ (
+ )
+
+
+
+function checks if list is empty
- Returns
- true if list is empty
+-
+false if list is not empty
+
+
+
+
+
+
+
+
+
+
+
+◆ push_back()
+
+
+
+
+
+ void list::push_back
+ (
+ int
+ new_elem )
+
+
+
+function adds new element to the end of the list
- Parameters
-
+
+ new_elem to be added to the end of the list
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ push_front()
+
+
+
+
+
+ void list::push_front
+ (
+ int
+ new_elem )
+
+
+
+function adds new element to the beginning of the list
- Parameters
-
+
+ new_elem to be added to front of the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ search()
+
+
+
+
+
+ std::shared_ptr< link > list::search
+ (
+ int
+ find_elem )
+
+
+
+function searchs for
- Parameters
-
+
+ find_elem in the list find_elem to be searched for in the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
+- data_structures/linked_list.cpp
+
+
+
+
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
+T reset(T... args)
+
+std::shared_ptr< link > firstlink before the actual first elementDefinition: linked_list.cpp:83
+
+
+
+
+
+ - Generated by
1.8.20
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.js b/d1/def/classdata__structures_1_1linked__list_1_1list.js
new file mode 100644
index 000000000..02427629c
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list.js
@@ -0,0 +1,13 @@
+var classdata__structures_1_1linked__list_1_1list =
+[
+ [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826", null ],
+ [ "display", "d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e", null ],
+ [ "erase", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e", null ],
+ [ "isEmpty", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a", null ],
+ [ "push_back", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5", null ],
+ [ "push_front", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0", null ],
+ [ "reverse", "d1/def/classdata__structures_1_1linked__list_1_1list.html#af0981944884c6dc19361ff67451261c9", null ],
+ [ "search", "d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835", null ],
+ [ "first", "d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1", null ],
+ [ "last", "d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8a5aa5c6dbbc5b882030b52619dd1a3", null ]
+];
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.map
new file mode 100644
index 000000000..fc05bdea4
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.md5
new file mode 100644
index 000000000..7328c33bb
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.md5
@@ -0,0 +1 @@
+c85fd56560fb17a64256a19f46635dba
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.svg
new file mode 100644
index 000000000..62ced11c4
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a098be172c737f236763afdb8cada4835_cgraph.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.map
new file mode 100644
index 000000000..fba46e2a5
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.md5
new file mode 100644
index 000000000..320b09e99
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.md5
@@ -0,0 +1 @@
+d5b211845dc8397edd46e92c065d0528
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg
new file mode 100644
index 000000000..6011bc510
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a1fb1792ab867dc26639eef368a56989e_cgraph.svg
@@ -0,0 +1,54 @@
+
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.map
new file mode 100644
index 000000000..3000a0387
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.md5
new file mode 100644
index 000000000..aeb88c84b
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.md5
@@ -0,0 +1 @@
+a2e6d5a23721969c3b07fe0962d6dd1f
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.svg
new file mode 100644
index 000000000..827e1365f
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.map
new file mode 100644
index 000000000..2e7797740
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.md5
new file mode 100644
index 000000000..1f68f4d8b
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.md5
@@ -0,0 +1 @@
+4f1fb5e679ae25a1b63844194c139096
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.svg
new file mode 100644
index 000000000..4a2caeb5a
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_abf7c97616b873ffeebdd0eac2d19d13e_cgraph.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.map
new file mode 100644
index 000000000..78f7e5e57
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.md5
new file mode 100644
index 000000000..b5b20d79b
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.md5
@@ -0,0 +1 @@
+f5abf2240e8d04e5e4061dc2e211b0c0
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg
new file mode 100644
index 000000000..ac20550c9
--- /dev/null
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html
index a41bcaf34..47469af81 100644
--- a/d1/df3/hash__search_8cpp.html
+++ b/d1/df3/hash__search_8cpp.html
@@ -206,7 +206,7 @@ int
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::list Class Reference
+
+
+
+
The documentation for this class was generated from the following file:
+
+Collaboration diagram for data_structures::linked_list::list:
+
+[legend]
+
+
++Public Member Functions | |
| list () | |
| bool | isEmpty () |
| void | push_back (int new_elem) |
| void | push_front (int new_elem) |
| void | erase (int old_elem) |
| void | display () |
| std::shared_ptr< link > | search (int find_elem) |
| +void | reverse () |
+Private Attributes | |
| +std::shared_ptr< link > | first |
| link before the actual first element | |
| +std::shared_ptr< link > | last |
| last link on the list | |
Detailed Description
+A list class containing a sequence of links
+Constructor & Destructor Documentation
+ +◆ list()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
Member Function Documentation
+ +◆ display()
+ +
+
+
+
+
+
+
| void list::display | +( | +) | ++ |
+
+function displays all the elements in the list
- Returns
- 'void'
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ erase()
+ +
+
+
+
+
+
+
| void list::erase | +( | +int | +old_elem | ) | ++ |
+
+function erases old element from the list
- Parameters
-
+
+
+old_elem to be erased from the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ isEmpty()
+ +
+
+
+
+
+
+
| bool list::isEmpty | +( | +) | ++ |
+
+function checks if list is empty
- Returns
- true if list is empty +
- +false if list is not empty
+
+
+
+
+
+
+
+◆ push_back()
+ +
+
+
+
+
+
+
| void list::push_back | +( | +int | +new_elem | ) | ++ |
+
+function adds new element to the end of the list
- Parameters
-
+
+
+new_elem to be added to the end of the list
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ push_front()
+ +
+
+
+
+
+
+
| void list::push_front | +( | +int | +new_elem | ) | ++ |
+
+function adds new element to the beginning of the list
- Parameters
-
+
+
+new_elem to be added to front of the list
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ search()
+ +
+
+
+
+
+
| std::shared_ptr< link > list::search | +( | +int | +find_elem | ) | ++ |
+
+function searchs for
- Parameters
-
+
+
+find_elem in the list find_elem to be searched for in the list
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+The documentation for this class was generated from the following file:
-
+
- data_structures/linked_list.cpp +
std::shared_ptr< link > last
last link on the list
Definition: linked_list.cpp:84
T reset(T... args)
std::shared_ptr< link > first
link before the actual first element
Definition: linked_list.cpp:83
-
+
+
- Generated by 1.8.20
+
n never gets freed. - Todo:
- fix memory leak
-
+
@@ -284,7 +284,7 @@ Here is the call graph for this function:
-
+
@@ -295,11 +295,11 @@ Here is the call graph for this function:
-
-
+
+
-
+
@@ -330,7 +330,7 @@ Here is the call graph for this function:
main function
-
+
@@ -347,9 +347,9 @@ Here is the call graph for this function:
-
-
-
+
+
+
@@ -382,18 +382,20 @@ Here is the call graph for this function:STL class.
Definition: avltree.cpp:13
T endl(T... args)
T malloc(T... args)
Definition: list_array.cpp:8
std::vector< int > t_size
a vector to store the subtree size rooted at node
Definition: heavy_light_decomposition.cpp:89
STL class.
void dfs_lca(int u, int p=-1)
Utility function to populate the t_par vector.
Definition: heavy_light_decomposition.cpp:116
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+linked_list Namespace Reference
+
+
+Functions for singly linked list algorithm. +More...
+Detailed Description
+Functions for singly linked list algorithm.
+
+
+
+
diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html
index dad24a96d..02f3fba64 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -137,7 +137,7 @@ Functions
-
+
+
- Generated by 1.8.20
+
Detailed Description
Implementation of Jarvis’s algorithm.
Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.
-
+
Algorithm
The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.
The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.
diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html index 83227c252..620a3ea12 100644 --- a/d5/d3c/namespacedata__structures.html +++ b/d5/d3c/namespacedata__structures.html @@ -98,7 +98,7 @@ $(document).ready(function(){initNavTree('d5/d3c/namespacedata__structures.html'
-
diff --git a/d5/d3c/namespacedata__structures.js b/d5/d3c/namespacedata__structures.js
index 471dc80cd..ef3d7aece 100644
--- a/d5/d3c/namespacedata__structures.js
+++ b/d5/d3c/namespacedata__structures.js
@@ -1,5 +1,9 @@
var namespacedata__structures =
[
+ [ "linked_list", null, [
+ [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
+ [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ]
+ ] ],
[ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ]
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 252d0204d..327f9363a 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
@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
Data-structure algorithms. +
Data Structures algorithms. More...
@@ -123,7 +123,8 @@ constexpr float | ||||
Detailed Description
-Data-structure algorithms.
+Data Structures algorithms.
+Data-structure algorithms.
List of all files
-
+
diff --git a/hierarchy.js b/hierarchy.js
index 89fb5bcd9..8d1a3cd03 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -10,21 +10,23 @@ var hierarchy =
[ "machine_learning::neural_network::layers::DenseLayer", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html", null ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
[ "Edge", "d7/d77/class_edge.html", null ],
- [ "linear_probing::Entry", "db/d19/structlinear__probing_1_1_entry.html", null ],
[ "double_hashing::Entry", "d9/dde/structdouble__hashing_1_1_entry.html", null ],
+ [ "linear_probing::Entry", "db/d19/structlinear__probing_1_1_entry.html", null ],
[ "quadratic_probing::Entry", "da/dd1/structquadratic__probing_1_1_entry.html", null ],
[ "FenwickTree", "dd/d91/class_fenwick_tree.html", null ],
- [ "Graph", "da/d9a/class_graph.html", null ],
- [ "graph::is_graph_bipartite::Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", null ],
[ "graph::Graph", "dc/d61/classgraph_1_1_graph.html", [
[ "graph::RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", null ]
] ],
+ [ "Graph", "da/d9a/class_graph.html", null ],
+ [ "graph::is_graph_bipartite::Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", null ],
[ "hash_chain", "dd/d1c/classhash__chain.html", null ],
[ "ciphers::HillCipher", "d6/d26/classciphers_1_1_hill_cipher.html", null ],
[ "Item", "db/d66/struct_item.html", null ],
[ "large_number", "db/d82/classlarge__number.html", null ],
+ [ "data_structures::linked_list::link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", null ],
[ "linkedlist", "d0/dff/structlinkedlist.html", null ],
[ "list", "d8/d10/structlist.html", null ],
+ [ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", null ],
[ "graph::LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", null ],
[ "MinHeap", "d2/d05/class_min_heap.html", null ],
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
@@ -34,8 +36,8 @@ var hierarchy =
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node< Type >", "d5/da1/structnode.html", null ],
- [ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
+ [ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
[ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
@@ -54,7 +56,7 @@ var hierarchy =
[ "range_queries::heavy_light_decomposition::Tree< X >", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", [
[ "range_queries::heavy_light_decomposition::HLD< X >", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", null ]
] ],
- [ "data_structures::trie", "d0/d3e/classdata__structures_1_1trie.html", null ],
[ "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 ]
];
\ No newline at end of file
diff --git a/index.html b/index.html
index b372686c2..5d2031321 100644
--- a/index.html
+++ b/index.html
@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
+
+
Self-checks within programs ensure correct implementations with confidence.
Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
-
+
+
diff --git a/inherit_graph_10.map b/inherit_graph_10.map
index 098bcdebd..ad33e8513 100644
--- a/inherit_graph_10.map
+++ b/inherit_graph_10.map
@@ -1,3 +1,3 @@
diff --git a/inherit_graph_10.md5 b/inherit_graph_10.md5
index 626407169..fadd17e74 100644
--- a/inherit_graph_10.md5
+++ b/inherit_graph_10.md5
@@ -1 +1 @@
-3698eafa20825f92264fab47ce72bb67
\ No newline at end of file
+328ab509bf116ce8b376591ac881beaf
\ No newline at end of file
diff --git a/inherit_graph_10.svg b/inherit_graph_10.svg
index c2523485e..915f29839 100644
--- a/inherit_graph_10.svg
+++ b/inherit_graph_10.svg
@@ -4,17 +4,17 @@
-
+
Backtracking
- Graph Coloring
@@ -106,7 +106,7 @@ Backtracking
- Rat Maze
- Sudoku Solve
-
+
Ciphers
- Caesar Cipher
@@ -114,7 +114,7 @@ Ciphers
Vigenere Cipher
Xor Cipher
-
+
Data Structures
- Avltree
@@ -150,7 +150,7 @@ Data Structures
Trie Modern
Trie Tree
-
+
Dynamic Programming
- 0 1 Knapsack
@@ -173,13 +173,13 @@ Dynamic Programming
Shortest Common Supersequence
Tree Height
-
+
Geometry
-
+
Graph
- Breadth First Search
@@ -200,12 +200,12 @@ Graph
Topological Sort
Topological Sort By Kahns Algo
-
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -214,7 +214,7 @@ Greedy Algorithms
Kruskals Minimum Spanning Tree
Prims Minimum Spanning Tree
-
+
Hashing
- Chaining
@@ -222,7 +222,7 @@ Hashing
Linear Probing Hash Table
Quadratic Probing Hash Table
-
+
Machine Learning
- Adaline Learning
@@ -232,7 +232,7 @@ Machine Learning
Ordinary Least Squares Regressor
Vector Ops
-
+
Math
- Armstrong Number
@@ -267,7 +267,7 @@ Math
String Fibonacci
Sum Of Digits
-
+
Numerical Methods
- Bisection Method
@@ -287,7 +287,7 @@ Numerical Methods
Qr Eigen Values
Successive Approximation
-
+
Operations On Datastructures
- Array Left Rotation
@@ -300,7 +300,7 @@ Operations On Datastructures
Selectionsortlinkedlist
Union Of 2 Arrays
-
+
Others
- Buzz Number
@@ -321,7 +321,7 @@ Others
Tower Of Hanoi
Vector Important Functions
-
+
Probability
- Addition Rule
@@ -329,7 +329,7 @@ Probability
Binomial Dist
Poisson Dist
-
+
Range Queries
- Fenwick Tree
@@ -337,7 +337,7 @@ Range Queries
Mo
Segtree
-
+
Search
- Binary Search
@@ -352,7 +352,7 @@ Search
Ternary Search
Text Search
-
+
Sorting
- Bead Sort
@@ -384,7 +384,7 @@ Sorting
Swap Sort
Tim Sort
-
+
Strings
- Brute Force String Searching
diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html
index ed37a6471..e69d0e935 100644
--- a/d5/da1/structnode.html
+++ b/d5/da1/structnode.html
@@ -180,7 +180,6 @@ class node< Kind >
- data_structures/circular_queue_using_linked_list.cpp
- data_structures/cll/cll.h
- data_structures/doubly_linked_list.cpp
-- data_structures/linked_list.cpp
- data_structures/queue.h
- data_structures/queue_using_linked_list.cpp
- data_structures/stack.h
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 12feef18f..11c0003db 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map
new file mode 100644
index 000000000..99af68cad
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map
@@ -0,0 +1,4 @@
+
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5
new file mode 100644
index 000000000..a104da770
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5
@@ -0,0 +1 @@
+c8bfb023f7b53f00969b5a91d8cb3e3a
\ No newline at end of file
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg
new file mode 100644
index 000000000..ddc57d170
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html
index 81f5b0e6c..31f8e1c99 100644
--- a/d7/d7c/classstatistics_1_1stats__computer1.html
+++ b/d7/d7c/classstatistics_1_1stats__computer1.html
@@ -99,6 +99,12 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compu
statistics::stats_computer1< T > Class Template Reference
+
+Collaboration diagram for statistics::stats_computer1< T >:
+
+
+
+[legend]
Public Member Functions
Namespaces
data_structures Data-structure algorithms.
Data Structures algorithms.
diff --git a/d7/de0/stack_8h_source.html b/d7/de0/stack_8h_source.html
index 1a76fff7e..33586cc5e 100644
--- a/d7/de0/stack_8h_source.html
+++ b/d7/de0/stack_8h_source.html
@@ -269,7 +269,7 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
STL class.
Definition: queue_using_linkedlist.cpp:6
-Data-structure algorithms.
+Data Structures algorithms.
diff --git a/d8/d38/queue_8h_source.html b/d8/d38/queue_8h_source.html
index ba7aeb017..d814a4358 100644
--- a/d8/d38/queue_8h_source.html
+++ b/d8/d38/queue_8h_source.html
@@ -185,41 +185,62 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
+bool isDigit(const std::string &s)Definition: linked_list.cpp:40
+
+
+STL class.
+
+Functions for singly linked list algorithm.
+Definition: linked_list.cpp:81
STL class.
+
+std::shared_ptr< link > lastlast link on the listDefinition: linked_list.cpp:84
Definition: avltree.cpp:13
struct list node
+std::shared_ptr< link > psuccpointer to the next value on the listDefinition: linked_list.cpp:56
-T reverse(T... args)
STL class.
+T reset(T... args)
+int pvaluevalue of the current linkDefinition: linked_list.cpp:55
Search algorithms.
Definition: linkedlist_implentation_usingarray.cpp:14
+
+void push_front(int new_elem)Definition: linked_list.cpp:137
+T stoi(T... args)
+void push_back(int new_elem)Definition: linked_list.cpp:123
Definition: cll.h:17
+std::shared_ptr< link > & succ()Definition: linked_list.cpp:69
+
+Data Structures algorithms.
void insertAtTheBeginning(int data)Definition: linkedlist_implentation_usingarray.cpp:50
-
+std::shared_ptr< link > search(int find_elem)Definition: linked_list.cpp:194
Definition: queue.h:17
+std::shared_ptr< link > firstlink before the actual first elementDefinition: linked_list.cpp:83
T endl(T... args)
+
T left(T... args)
STL namespace.
-void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)Definition: tower_of_hanoi.cpp:19
+
+Definition: linked_list.cpp:53
Definition: morrisinorder.cpp:10
Definition: doubly_linked_list.cpp:11
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html
index 6fdadf54e..c2ddf2ea3 100644
--- a/d8/d95/vector__ops_8hpp_source.html
+++ b/d8/d95/vector__ops_8hpp_source.html
@@ -837,7 +837,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
void test_3d_classes1(std::vector< std::valarray< double >> *data)Definition: kohonen_som_topology.cpp:411
-Data-structure algorithms.
+Data Structures algorithms.
bool on_segment(Point first_point, Point second_point, Point third_point)Definition: line_segment_intersection.cpp:75
bool is_bipartite()function to add edges to our graphDefinition: is_graph_bipartite.cpp:106
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
new file mode 100644
index 000000000..66d251619
--- /dev/null
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -0,0 +1,119 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::list Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::list, including all inherited members.
+
+ display() data_structures::linked_list::list erase(int old_elem) data_structures::linked_list::list first data_structures::linked_list::list private isEmpty() data_structures::linked_list::list last data_structures::linked_list::list private list() data_structures::linked_list::list inline push_back(int new_elem) data_structures::linked_list::list push_front(int new_elem) data_structures::linked_list::list reverse() (defined in data_structures::linked_list::list) data_structures::linked_list::list search(int find_elem) data_structures::linked_list::list
+
+
+
+
+ - Generated by 1.8.20
+
+
+
+
diff --git a/d9/db7/linked__list_8cpp__incl.map b/d9/db7/linked__list_8cpp__incl.map
new file mode 100644
index 000000000..2a6f17309
--- /dev/null
+++ b/d9/db7/linked__list_8cpp__incl.map
@@ -0,0 +1,6 @@
+
diff --git a/d9/db7/linked__list_8cpp__incl.md5 b/d9/db7/linked__list_8cpp__incl.md5
new file mode 100644
index 000000000..c22e7205e
--- /dev/null
+++ b/d9/db7/linked__list_8cpp__incl.md5
@@ -0,0 +1 @@
+f0789173b7ee85210791cdc6a416a650
\ No newline at end of file
diff --git a/d9/db7/linked__list_8cpp__incl.svg b/d9/db7/linked__list_8cpp__incl.svg
new file mode 100644
index 000000000..8b0cb1b9e
--- /dev/null
+++ b/d9/db7/linked__list_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
diff --git a/da/dc3/linked__list_8cpp.html b/da/dc3/linked__list_8cpp.html
new file mode 100644
index 000000000..631a3d549
--- /dev/null
+++ b/da/dc3/linked__list_8cpp.html
@@ -0,0 +1,291 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures/linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+linked_list.cpp File Reference
+
+
+
+Implementation of singly linked list algorithm.
+More...
+#include <iostream>
+#include <memory>
+#include <string>
+
+Include dependency graph for linked_list.cpp:
+
+
+
+
+
+
+Classes
class data_structures::linked_list::link class data_structures::linked_list::list
+
+Namespaces
data_structures Data Structures algorithms.
linked_list Functions for singly linked list algorithm.
+
+Functions
bool data_structures::linked_list::isDigit (const std::string &s) int main ()
+Detailed Description
+Implementation of singly linked list algorithm.
+The linked list is a data structure used for holding a sequence of values, which can be added, removed and displayed.
+
+Algorithm
+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.
+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.
+Function Documentation
+
+◆ isDigit()
+
+
+
+
+
+ bool data_structures::linked_list::isDigit
+ (
+ const std::string &
+ s )
+
+
+
+This function checks if the string passed consists of only digits.
- Parameters
-
+
+ s To be checked if s contains only integers
+
+
+- Returns
- true if there are only only digits present in the string
+-
+false if any other character is found
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+Main function: Allows the user add and delete values from the list. Also allows user to search for and display values in the list.
- Returns
- 0 on exit
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
+T isdigit(T... args)
+
+STL class.
+
+Definition: linked_list.cpp:81
+
+T stoi(T... args)
+void push_back(int new_elem)Definition: linked_list.cpp:123
+
+std::shared_ptr< link > search(int find_elem)Definition: linked_list.cpp:194
+T endl(T... args)
+
+
+
+
+
+ - Generated by 1.8.20
+
+
+
+
diff --git a/da/dc3/linked__list_8cpp.js b/da/dc3/linked__list_8cpp.js
new file mode 100644
index 000000000..289782b8d
--- /dev/null
+++ b/da/dc3/linked__list_8cpp.js
@@ -0,0 +1,7 @@
+var linked__list_8cpp =
+[
+ [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
+ [ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
+ [ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ],
+ [ "main", "da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
+];
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map
new file mode 100644
index 000000000..829ec14a1
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map
@@ -0,0 +1,3 @@
+
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5 b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5
new file mode 100644
index 000000000..eab4322ce
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5
@@ -0,0 +1 @@
+2b2668eba45c6e2fb8b91b189fe8e6a5
\ 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
new file mode 100644
index 000000000..53fec400e
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..2a057f721
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..dd0b4b235
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+5562c38dc3edb2a9bc6dbb71b5f4d23c
\ 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
new file mode 100644
index 000000000..aeb2eb073
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,165 @@
+
+
+
+
+
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
new file mode 100644
index 000000000..8da8713f7
--- /dev/null
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map
@@ -0,0 +1,4 @@
+
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
new file mode 100644
index 000000000..8e58b3886
--- /dev/null
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5
@@ -0,0 +1 @@
+b1e11e055685e4ded564a9355fe80547
\ 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
new file mode 100644
index 000000000..3c1c52a2d
--- /dev/null
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg
@@ -0,0 +1,48 @@
+
+
+
+
+
diff --git a/de/d9d/classdata__structures_1_1linked__list_1_1link.html b/de/d9d/classdata__structures_1_1linked__list_1_1link.html
new file mode 100644
index 000000000..77c4b1c7b
--- /dev/null
+++ b/de/d9d/classdata__structures_1_1linked__list_1_1link.html
@@ -0,0 +1,234 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: data_structures::linked_list::link Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::link Class Reference
+
+
+
+Collaboration diagram for data_structures::linked_list::link:
+
+
+
+[legend]
+
+
+Public Member Functions
int val () std::shared_ptr< link > & succ () link (int value=0)
+
+Private Attributes
+int pvalue value of the current link
+std::shared_ptr< link > psucc pointer to the next value on the list
+Detailed Description
+A link class containing a value and pointer to another link
+Constructor & Destructor Documentation
+
+◆ link()
+
+
+
+
+
+
+
+
+ data_structures::linked_list::link::link
+ (
+ int
+ value = 0 )
+
+
+
+
+inlineexplicit
+
+
+
+
+Member Function Documentation
+
+◆ succ()
+
+
+
+
+
+
+
+
+ std::shared_ptr<link>& data_structures::linked_list::link::succ
+ (
+ )
+
+
+
+
+inline
+
+
+
+function returns the pointer to next link
- Returns
- the pointer to the next link
+
+
+
+
+
+◆ val()
+
+
+
+
+
+
+
+
+ int data_structures::linked_list::link::val
+ (
+ )
+
+
+
+
+inline
+
+
+
+function returns the integer value stored in the link.
- Returns
- the integer value stored in the link.
+
+
+
+
+
The documentation for this class was generated from the following file:
+- data_structures/linked_list.cpp
+
+
+
+std::shared_ptr< link > psuccpointer to the next value on the listDefinition: linked_list.cpp:56
+int pvaluevalue of the current linkDefinition: linked_list.cpp:55
+
+
+
+
+ - Generated by 1.8.20
+
+
+
+
diff --git a/de/d9d/classdata__structures_1_1linked__list_1_1link.js b/de/d9d/classdata__structures_1_1linked__list_1_1link.js
new file mode 100644
index 000000000..6325ba124
--- /dev/null
+++ b/de/d9d/classdata__structures_1_1linked__list_1_1link.js
@@ -0,0 +1,8 @@
+var classdata__structures_1_1linked__list_1_1link =
+[
+ [ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb", null ],
+ [ "succ", "de/d9d/classdata__structures_1_1linked__list_1_1link.html#a28781355a468a1b95278ffe6277f3b6c", null ],
+ [ "val", "de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11", null ],
+ [ "psucc", "de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081", null ],
+ [ "pvalue", "de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936", null ]
+];
\ No newline at end of file
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
new file mode 100644
index 000000000..1947de80d
--- /dev/null
+++ b/df/d11/classdata__structures_1_1linked__list_1_1link-members.html
@@ -0,0 +1,114 @@
+
+
+
+
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::link Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::link, including all inherited members.
+
+ link(int value=0) data_structures::linked_list::link inlineexplicit psucc data_structures::linked_list::link private pvalue data_structures::linked_list::link private succ() data_structures::linked_list::link inline val() data_structures::linked_list::link inline
+
+
+
+
+ - Generated by 1.8.20
+
+
+
+
diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
index 1e41cbe0c..437a1bcb2 100644
--- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
+++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
@@ -112,6 +112,9 @@ Files
file disjoint_set.cpp Disjoint Sets Data Structure (Disjoint Sets)
file linked_list.cpp Implementation of singly linked list algorithm.
file linkedlist_implentation_usingarray.cpp Linked list implementation using Arrays.
► dynamic_programming ► geometry display()
-: hash_chain
+: data_structures::linked_list::list
+, hash_chain
, queue< Kind >
, stack< Type >
diff --git a/functions_e.html b/functions_e.html
index ab059c650..c705f511b 100644
--- a/functions_e.html
+++ b/functions_e.html
@@ -107,6 +107,9 @@ $(document).ready(function(){initNavTree('functions_e.html',''); initResizable()
, linear_probing::Entry
, quadratic_probing::Entry
+erase()
+: data_structures::linked_list::list
+
eta
: machine_learning::adaline
diff --git a/functions_f.html b/functions_f.html
index f330de6d1..3b3bfd42e 100644
--- a/functions_f.html
+++ b/functions_f.html
@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_f.html',''); initResizable()
find()
: hash_chain
+first
+: data_structures::linked_list::list
+
fit()
: machine_learning::adaline
, machine_learning::neural_network::NeuralNetwork
diff --git a/functions_func.html b/functions_func.html
index 9bdbcf1d6..d705a0d56 100644
--- a/functions_func.html
+++ b/functions_func.html
@@ -214,7 +214,8 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
: SegmentIntersection
display()
-: hash_chain
+: data_structures::linked_list::list
+, hash_chain
, queue< Kind >
, stack< Type >
@@ -239,6 +240,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
, linear_probing::Entry
, quadratic_probing::Entry
+erase()
+: data_structures::linked_list::list
+
evaluate()
: machine_learning::neural_network::NeuralNetwork
@@ -362,6 +366,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
isCyclicDFSHelper()
: CycleCheck
+isEmpty()
+: data_structures::linked_list::list
+
isEmptyQueue()
: queue< Kind >
@@ -391,6 +398,12 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
lift()
: range_queries::heavy_light_decomposition::Tree< X >
+link()
+: data_structures::linked_list::link
+
+list()
+: data_structures::linked_list::list
+
load_model()
: machine_learning::neural_network::NeuralNetwork
@@ -509,6 +522,12 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
push()
: stack< Type >
+push_back()
+: data_structures::linked_list::list
+
+push_front()
+: data_structures::linked_list::list
+
@@ -550,7 +569,8 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
: machine_learning::neural_network::NeuralNetwork
search()
-: data_structures::trie
+: data_structures::linked_list::list
+, data_structures::trie
, Trie
searchElement()
@@ -578,6 +598,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
: statistics::stats_computer1< T >
, statistics::stats_computer2< T >
+succ()
+: data_structures::linked_list::link
+
sum()
: FenwickTree
@@ -619,6 +642,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
- v -
+- val()
+: data_structures::linked_list::link
+
- variance()
: statistics::stats_computer1< T >
, statistics::stats_computer2< T >
diff --git a/functions_i.html b/functions_i.html
index ad19f2eb5..557c5a5ca 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -122,6 +122,9 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
- isCyclicDFSHelper()
: CycleCheck
+- isEmpty()
+: data_structures::linked_list::list
+
- isEmptyQueue()
: queue< Kind >
diff --git a/functions_l.html b/functions_l.html
index 20eef4caf..9c5f15c5c 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- large_number()
: large_number
+- last
+: data_structures::linked_list::list
+
- lca()
: range_queries::heavy_light_decomposition::Tree< X >
@@ -112,6 +115,12 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
- lift()
: range_queries::heavy_light_decomposition::Tree< X >
+- link()
+: data_structures::linked_list::link
+
+- list()
+: data_structures::linked_list::list
+
- load_model()
: machine_learning::neural_network::NeuralNetwork
diff --git a/functions_p.html b/functions_p.html
index 8db50ce59..3ab47bdb5 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -111,9 +111,21 @@ $(document).ready(function(){initNavTree('functions_p.html',''); initResizable()
- predict()
: machine_learning::adaline
+- psucc
+: data_structures::linked_list::link
+
- push()
: stack< Type >
+- push_back()
+: data_structures::linked_list::list
+
+- push_front()
+: data_structures::linked_list::list
+
+- pvalue
+: data_structures::linked_list::link
+
diff --git a/functions_s.html b/functions_s.html
index 7f7118b47..29a0987e0 100644
--- a/functions_s.html
+++ b/functions_s.html
@@ -103,7 +103,8 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
: machine_learning::neural_network::NeuralNetwork
search()
-: data_structures::trie
+: data_structures::linked_list::list
+, data_structures::trie
, Trie
searchElement()
@@ -134,7 +135,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
: range_queries::heavy_light_decomposition::SG< X >
stack()
-: stack< Type >
+: stack< Type >
stackTop
: stack< Type >
@@ -143,6 +144,9 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
: statistics::stats_computer1< T >
, statistics::stats_computer2< T >
+succ()
+: data_structures::linked_list::link
+
sum()
: FenwickTree
diff --git a/functions_v.html b/functions_v.html
index 68e0195ce..6d95c1c15 100644
--- a/functions_v.html
+++ b/functions_v.html
@@ -93,6 +93,9 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
Here is a list of all documented class members with links to the class documentation for each member:
- v -
+- val()
+: data_structures::linked_list::link
+
- value
: data_structures::Node
diff --git a/functions_vars.html b/functions_vars.html
index 70e833eb9..a9ed1ca1e 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -137,6 +137,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- f -
+- first
+: data_structures::linked_list::list
+
- forward
: data_structures::Node
@@ -190,6 +193,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- label
: range_queries::heavy_light_decomposition::HLD< X >
+- last
+: data_structures::linked_list::list
+
- level
: data_structures::SkipList
, graph::RootedTree
@@ -219,6 +225,12 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
- parent
: graph::RootedTree
+- psucc
+: data_structures::linked_list::link
+
+- pvalue
+: data_structures::linked_list::link
+
diff --git a/globals_func_m.html b/globals_func_m.html
index 933c89a02..ed2532a4d 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -98,17 +98,17 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, knight_tour.cpp
, n_queens.cpp
, hill_cipher.cpp
-, trie_modern.cpp
-, quadratic_probing_hash_table.cpp
+, skip_list.cpp
+, linear_probing_hash_table.cpp
+, sieve_of_eratosthenes.cpp
, sqrt_double.cpp
+, quadratic_probing_hash_table.cpp
, string_fibonacci.cpp
-, adaline_learning.cpp
, sum_of_digits.cpp
+, trie_modern.cpp
+, adaline_learning.cpp
, bisection_method.cpp
-, trie_tree.cpp
-, kohonen_som_topology.cpp
, brent_method_extrema.cpp
-, false_position.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, brute_force_string_searching.cpp
@@ -162,15 +162,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, ode_forward_euler.cpp
, newton_raphson_method.cpp
, lu_decompose.cpp
-, kohonen_som_trace.cpp
-, gaussian_elimination.cpp
, golden_search_extrema.cpp
+, kohonen_som_topology.cpp
+, false_position.cpp
+, gaussian_elimination.cpp
, vigenere_cipher.cpp
-, shortest_common_supersequence.cpp
+, trie_tree.cpp
+, kohonen_som_trace.cpp
, neural_network.cpp
-, ordinary_least_squares_regressor.cpp
-, jarvis_algorithm.cpp
-, sieve_of_eratosthenes.cpp
+, shortest_common_supersequence.cpp
, realtime_stats.cpp
, primes_up_to_billion.cpp
, prime_numbers.cpp
@@ -194,15 +194,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, complex_numbers.cpp
, check_prime.cpp
, check_amicable_pair.cpp
-, armstrong_number.cpp
, binary_exponent.cpp
+, ordinary_least_squares_regressor.cpp
+, armstrong_number.cpp
, nqueen_print_all_solutions.cpp
, xor_cipher.cpp
+, jarvis_algorithm.cpp
, line_segment_intersection.cpp
-, breadth_first_search.cpp
, avltree.cpp
-, connected_components.cpp
-, linear_probing_hash_table.cpp
+, breadth_first_search.cpp
, double_hash_hash_table.cpp
, chaining.cpp
, spirograph.cpp
@@ -211,13 +211,14 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, hamiltons_cycle.cpp
, dijkstra.cpp
, depth_first_search.cpp
+, connected_components.cpp
, minimax.cpp
, sudoku_solve.cpp
, disjoint_set.cpp
-, linkedlist_implentation_usingarray.cpp
+, linked_list.cpp
, caesar_cipher.cpp
+, linkedlist_implentation_usingarray.cpp
, queue_using_two_stacks.cpp
-, skip_list.cpp
- mat_mul()
: qr_eigen_values.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 866088b6a..bfe3b0d00 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
- show_pascal()
: pascal_triangle.cpp
-- sieve()
-: sieve_of_eratosthenes.cpp
-
- Sieve()
: primes_up_to_billion.cpp
+- sieve()
+: sieve_of_eratosthenes.cpp
+
- SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_m.html b/globals_m.html
index 16c333214..8bf2fb95a 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -98,28 +98,28 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, knight_tour.cpp
, n_queens.cpp
, hill_cipher.cpp
-, trie_modern.cpp
-, quadratic_probing_hash_table.cpp
+, skip_list.cpp
+, linear_probing_hash_table.cpp
+, sieve_of_eratosthenes.cpp
, sqrt_double.cpp
+, quadratic_probing_hash_table.cpp
, string_fibonacci.cpp
-, adaline_learning.cpp
, sum_of_digits.cpp
+, trie_modern.cpp
+, adaline_learning.cpp
, bisection_method.cpp
-, trie_tree.cpp
-, kohonen_som_topology.cpp
, brent_method_extrema.cpp
+, kohonen_som_topology.cpp
, false_position.cpp
-, kohonen_som_trace.cpp
, gaussian_elimination.cpp
-, golden_search_extrema.cpp
, vigenere_cipher.cpp
-, shortest_common_supersequence.cpp
-, neural_network.cpp
+, trie_tree.cpp
+, kohonen_som_trace.cpp
+, golden_search_extrema.cpp
, lu_decompose.cpp
+, neural_network.cpp
, newton_raphson_method.cpp
-, ordinary_least_squares_regressor.cpp
, ode_forward_euler.cpp
-, ode_midpoint_euler.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, brute_force_string_searching.cpp
@@ -167,21 +167,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, buzz_number.cpp
, successive_approximation.cpp
, qr_eigen_values.cpp
-, jarvis_algorithm.cpp
-, armstrong_number.cpp
-, ode_semi_implicit_euler.cpp
, qr_decomposition.cpp
-, binary_exponent.cpp
+, shortest_common_supersequence.cpp
+, ordinary_least_squares_regressor.cpp
+, ode_midpoint_euler.cpp
+, ode_semi_implicit_euler.cpp
+, armstrong_number.cpp
, nqueen_print_all_solutions.cpp
, xor_cipher.cpp
-, line_segment_intersection.cpp
+, jarvis_algorithm.cpp
+, binary_exponent.cpp
, check_amicable_pair.cpp
+, line_segment_intersection.cpp
, check_prime.cpp
-, breadth_first_search.cpp
, complex_numbers.cpp
-, double_factorial.cpp
, avltree.cpp
-, sieve_of_eratosthenes.cpp
, realtime_stats.cpp
, primes_up_to_billion.cpp
, prime_numbers.cpp
@@ -199,25 +199,26 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, fibonacci.cpp
, fast_power.cpp
, factorial.cpp
-, connected_components.cpp
-, eulers_totient_function.cpp
, extended_euclid_algorithm.cpp
-, depth_first_search.cpp
+, breadth_first_search.cpp
+, double_factorial.cpp
+, eulers_totient_function.cpp
+, connected_components.cpp
, minimax.cpp
, sudoku_solve.cpp
, disjoint_set.cpp
+, depth_first_search.cpp
, dijkstra.cpp
+, linked_list.cpp
, hamiltons_cycle.cpp
-, linkedlist_implentation_usingarray.cpp
, is_graph_bipartite.cpp
-, lowest_common_ancestor.cpp
, caesar_cipher.cpp
-, queue_using_two_stacks.cpp
-, linear_probing_hash_table.cpp
+, linkedlist_implentation_usingarray.cpp
, double_hash_hash_table.cpp
-, spirograph.cpp
, chaining.cpp
-, skip_list.cpp
+, lowest_common_ancestor.cpp
+, spirograph.cpp
+, queue_using_two_stacks.cpp
- mat_mul()
: qr_eigen_values.cpp
@@ -230,18 +231,18 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
- MAX
: fibonacci_fast.cpp
+, ternary_search.cpp
+, paranthesis_matching.cpp
, power_for_huge_numbers.cpp
, hash_search.cpp
-, paranthesis_matching.cpp
-, ternary_search.cpp
- MAX_ITER
: adaline_learning.cpp
- MAX_ITERATIONS
-: newton_raphson_method.cpp
-, false_position.cpp
+: false_position.cpp
, bisection_method.cpp
+, newton_raphson_method.cpp
- merge()
: merge_sort.cpp
diff --git a/globals_p.html b/globals_p.html
index e0bfe83cf..0fbc24bc2 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
- predict_OLS_regressor()
: ordinary_least_squares_regressor.cpp
-- PRIME
-: rabin_karp.cpp
-
- prime
: primes_up_to_billion.cpp
+- PRIME
+: rabin_karp.cpp
+
- prime_factorization()
: prime_factorization.cpp
diff --git a/globals_s.html b/globals_s.html
index 60322bc2d..8ec275802 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
- show_pascal()
: pascal_triangle.cpp
-- Sieve()
-: primes_up_to_billion.cpp
-
- sieve()
: sieve_of_eratosthenes.cpp
+- Sieve()
+: primes_up_to_billion.cpp
+
- SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/hierarchy.html b/hierarchy.html
index a33611c36..01430b4b4 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -108,50 +108,52 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cmachine_learning::neural_network::layers::DenseLayer Cdouble_linked_list CEdge Clinear_probing::Entry Cdouble_hashing::Entry Cdouble_hashing::Entry Clinear_probing::Entry Cquadratic_probing::Entry CFenwickTree CGraph Cgraph::is_graph_bipartite::Graph Class for representing graph as an adjacency list ▼Cgraph::Graph Cgraph::RootedTree ▼Cgraph::Graph Cgraph::RootedTree CGraph Cgraph::is_graph_bipartite::Graph Class for representing graph as an adjacency list Chash_chain Chain class with a given modulus Cciphers::HillCipher Implementation of Hill Cipher algorithm CItem Clarge_number Clinkedlist Clist Cgraph::LowestCommonAncestor CMinHeap CMinHeapNode Cmst Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cnode< Kind > CNode Cnode< Type > Cgeometry::jarvis::Point CPoint Cquery Cqueue< Kind > CQueue CQueue_Array CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::trie Trie implementation for small-case English alphabets a-z CTrie CTrie::TrieNode Cdata_structures::linked_list::link Clinkedlist Clist Cdata_structures::linked_list::list Cgraph::LowestCommonAncestor CMinHeap CMinHeapNode Cmst Cmachine_learning::neural_network::NeuralNetwork Cdata_structures::Node Cnode< Kind > CNode Cnode< Type > CPoint Cgeometry::jarvis::Point Cquery Cqueue< Kind > CQueue CQueue_Array CSegmentIntersection ▼Crange_queries::heavy_light_decomposition::SG< X > Segment Tree, to store heavy chains Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class Cdata_structures::SkipList CSolution Cstack< Type > Cstack_linkedList Cstatistics::stats_computer1< T > Cstatistics::stats_computer2< T > Ctower ▼Crange_queries::heavy_light_decomposition::Tree< X > A Basic Tree, which supports binary lifting Crange_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class CTrie Cdata_structures::trie Trie implementation for small-case English alphabets a-z CTrie::TrieNode
Backtracking
- Graph Coloring @@ -106,7 +106,7 @@ Backtracking
- Rat Maze
- Sudoku Solve
+
Ciphers
- Caesar Cipher
@@ -114,7 +114,7 @@ Ciphers
+
Data Structures
- Avltree
@@ -150,7 +150,7 @@ Data Structures
+
Dynamic Programming
- 0 1 Knapsack
@@ -173,13 +173,13 @@ Dynamic Programming
+
Geometry
-
+
Graph
- Breadth First Search
@@ -200,12 +200,12 @@ Graph
Graph
- Breadth First Search @@ -200,12 +200,12 @@ Graph
+
Graphics
-
+
Greedy Algorithms
- Dijkstra
@@ -214,7 +214,7 @@ Greedy Algorithms
Greedy Algorithms
- Dijkstra @@ -214,7 +214,7 @@ Greedy Algorithms
+
Hashing
- Chaining
@@ -222,7 +222,7 @@ Hashing
+
Machine Learning
- Adaline Learning
@@ -232,7 +232,7 @@ Machine Learning
+
Math
- Armstrong Number
@@ -267,7 +267,7 @@ Math
+
Numerical Methods
- Bisection Method
@@ -287,7 +287,7 @@ Numerical Methods
+
Operations On Datastructures
- Array Left Rotation
@@ -300,7 +300,7 @@ Operations On Datastructures
+
Others
- Buzz Number
@@ -321,7 +321,7 @@ Others
+
Probability
- Addition Rule
@@ -329,7 +329,7 @@ Probability
+
Range Queries
- Fenwick Tree
@@ -337,7 +337,7 @@ Range Queries
+
Search
- Binary Search
@@ -352,7 +352,7 @@ Search
+
Sorting
- Bead Sort
@@ -384,7 +384,7 @@ Sorting
+
Strings
- Brute Force String Searching
diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html
index ed37a6471..e69d0e935 100644
--- a/d5/da1/structnode.html
+++ b/d5/da1/structnode.html
@@ -180,7 +180,6 @@ class node< Kind >
- data_structures/circular_queue_using_linked_list.cpp
- data_structures/cll/cll.h
- data_structures/doubly_linked_list.cpp
-- data_structures/linked_list.cpp
- data_structures/queue.h
- data_structures/queue_using_linked_list.cpp
- data_structures/stack.h
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 12feef18f..11c0003db 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -136,7 +136,7 @@ Functions
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map
new file mode 100644
index 000000000..99af68cad
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map
@@ -0,0 +1,4 @@
+
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5
new file mode 100644
index 000000000..a104da770
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5
@@ -0,0 +1 @@
+c8bfb023f7b53f00969b5a91d8cb3e3a
\ No newline at end of file
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg
new file mode 100644
index 000000000..ddc57d170
--- /dev/null
+++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html
index 81f5b0e6c..31f8e1c99 100644
--- a/d7/d7c/classstatistics_1_1stats__computer1.html
+++ b/d7/d7c/classstatistics_1_1stats__computer1.html
@@ -99,6 +99,12 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compu
statistics::stats_computer1< T > Class Template Reference
Detailed Description
Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
+
Algorithm
Shuffle the array untill array is sorted.
diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map new file mode 100644 index 000000000..99af68cad --- /dev/null +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.map @@ -0,0 +1,4 @@ + diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 new file mode 100644 index 000000000..a104da770 --- /dev/null +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.md5 @@ -0,0 +1 @@ +c8bfb023f7b53f00969b5a91d8cb3e3a \ No newline at end of file diff --git a/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg new file mode 100644 index 000000000..ddc57d170 --- /dev/null +++ b/d6/d38/classstatistics_1_1stats__computer1__coll__graph.svg @@ -0,0 +1,38 @@ + + + + + diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html index 81f5b0e6c..31f8e1c99 100644 --- a/d7/d7c/classstatistics_1_1stats__computer1.html +++ b/d7/d7c/classstatistics_1_1stats__computer1.html @@ -99,6 +99,12 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compustatistics::stats_computer1< T > Class Template Reference
+Collaboration diagram for statistics::stats_computer1< T >:
+
+[legend]
+
+Public Member Functions | |
Namespaces | |
| data_structures | |
| Data-structure algorithms. | |
| Data Structures algorithms. | |
diff --git a/d7/de0/stack_8h_source.html b/d7/de0/stack_8h_source.html
index 1a76fff7e..33586cc5e 100644
--- a/d7/de0/stack_8h_source.html
+++ b/d7/de0/stack_8h_source.html
@@ -269,7 +269,7 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
STL class. Definition: linked_list.cpp:81 std::shared_ptr< link > last last link on the list Definition: linked_list.cpp:84 Definition: avltree.cpp:13 T reverse(T... args) int pvalue value of the current link Definition: linked_list.cpp:55 Search algorithms. void push_back(int new_elem) Definition: linked_list.cpp:123 Data Structures algorithms. std::shared_ptr< link > search(int find_elem) Definition: linked_list.cpp:194 std::shared_ptr< link > first link before the actual first element Definition: linked_list.cpp:83 T left(T... args) Definition: linked_list.cpp:53 Definition: morrisinorder.cpp:10 Data Structures algorithms. bool on_segment(Point first_point, Point second_point, Point third_point) Definition: line_segment_intersection.cpp:75 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| file | disjoint_set.cpp | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Disjoint Sets Data Structure (Disjoint Sets) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| file | linked_list.cpp | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Implementation of singly linked list algorithm. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| file | linkedlist_implentation_usingarray.cpp | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Linked list implementation using Arrays. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ► dynamic_programming | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ► geometry | Cmachine_learning::neural_network::layers::DenseLayer | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdouble_linked_list | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CEdge | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clinear_probing::Entry | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdouble_hashing::Entry | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdouble_hashing::Entry | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clinear_probing::Entry | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cquadratic_probing::Entry | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CFenwickTree | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CGraph | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::is_graph_bipartite::Graph | Class for representing graph as an adjacency list | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Cgraph::Graph | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::RootedTree | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Cgraph::Graph | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::RootedTree | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CGraph | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::is_graph_bipartite::Graph | Class for representing graph as an adjacency list | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Chash_chain | Chain class with a given modulus | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cciphers::HillCipher | Implementation of Hill Cipher algorithm | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CItem | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clarge_number | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clinkedlist | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clist | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::LowestCommonAncestor | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CMinHeap | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CMinHeapNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cmst | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cmachine_learning::neural_network::NeuralNetwork | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::Node | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cnode< Kind > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cnode< Type > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgeometry::jarvis::Point | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CPoint | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cquery | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cqueue< Kind > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CQueue | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CQueue_Array | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CSegmentIntersection | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Crange_queries::heavy_light_decomposition::SG< X > | Segment Tree, to store heavy chains | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::SkipList | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CSolution | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstack< Type > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstack_linkedList | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstatistics::stats_computer1< T > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstatistics::stats_computer2< T > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Ctower | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Crange_queries::heavy_light_decomposition::Tree< X > | A Basic Tree, which supports binary lifting | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::trie | Trie implementation for small-case English alphabets a-z | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CTrie | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CTrie::TrieNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::linked_list::link | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clinkedlist | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Clist | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::linked_list::list | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgraph::LowestCommonAncestor | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CMinHeap | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CMinHeapNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cmst | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cmachine_learning::neural_network::NeuralNetwork | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::Node | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cnode< Kind > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cnode< Type > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CPoint | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cgeometry::jarvis::Point | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cquery | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cqueue< Kind > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CQueue | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CQueue_Array | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CSegmentIntersection | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Crange_queries::heavy_light_decomposition::SG< X > | Segment Tree, to store heavy chains | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::SkipList | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CSolution | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstack< Type > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstack_linkedList | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstatistics::stats_computer1< T > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cstatistics::stats_computer2< T > | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Ctower | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ▼Crange_queries::heavy_light_decomposition::Tree< X > | A Basic Tree, which supports binary lifting | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CTrie | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Cdata_structures::trie | Trie implementation for small-case English alphabets a-z | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| CTrie::TrieNode | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Definition: queue_using_linkedlist.cpp:6
Data-structure algorithms.
Data Structures algorithms.
bool isDigit(const std::string &s)
Definition: linked_list.cpp:40
STL class.
Functions for singly linked list algorithm.
STL class.
struct list node
std::shared_ptr< link > psucc
pointer to the next value on the list
Definition: linked_list.cpp:56
STL class.
T reset(T... args)
Definition: linkedlist_implentation_usingarray.cpp:14
void push_front(int new_elem)
Definition: linked_list.cpp:137
T stoi(T... args)
Definition: cll.h:17
std::shared_ptr< link > & succ()
Definition: linked_list.cpp:69
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
Definition: queue.h:17
T endl(T... args)
STL namespace.
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
Definition: doubly_linked_list.cpp:11
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:411
Data-structure algorithms.
bool is_bipartite()
function to add edges to our graph
Definition: is_graph_bipartite.cpp:106
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::list Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::list, including all inherited members.
+| display() | data_structures::linked_list::list | |
| erase(int old_elem) | data_structures::linked_list::list | |
| first | data_structures::linked_list::list | private |
| isEmpty() | data_structures::linked_list::list | |
| last | data_structures::linked_list::list | private |
| list() | data_structures::linked_list::list | inline |
| push_back(int new_elem) | data_structures::linked_list::list | |
| push_front(int new_elem) | data_structures::linked_list::list | |
| reverse() (defined in data_structures::linked_list::list) | data_structures::linked_list::list | |
| search(int find_elem) | data_structures::linked_list::list |
-
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+linked_list.cpp File Reference
+
+
+
+
+
+
+
+
+
+Implementation of singly linked list algorithm. +More...
+#include <iostream>+
#include <memory>+
#include <string>+
+Include dependency graph for linked_list.cpp:
+
+
+
+
++Classes | |
| class | data_structures::linked_list::link |
| class | data_structures::linked_list::list |
+Namespaces | |
| data_structures | |
| Data Structures algorithms. | |
| linked_list | |
| Functions for singly linked list algorithm. | |
+Functions | |
| bool | data_structures::linked_list::isDigit (const std::string &s) |
| int | main () |
Detailed Description
+Implementation of singly linked list algorithm.
+The linked list is a data structure used for holding a sequence of values, which can be added, removed and displayed.
++Algorithm
+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.
+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.
+Function Documentation
+ +◆ isDigit()
+ +
+
+
+
+
+
+
| bool data_structures::linked_list::isDigit | +( | +const std::string & | +s | ) | ++ |
+
+This function checks if the string passed consists of only digits.
- Parameters
-
+
+
+s To be checked if s contains only integers
+
- Returns
- true if there are only only digits present in the string +
- +false if any other character is found
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ main()
+ +
+
+
+
+
+
| int main | +( | +void | +) | ++ |
+
+Main function: Allows the user add and delete values from the list. Also allows user to search for and display values in the list.
- Returns
- 0 on exit
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+T isdigit(T... args)
STL class.
Definition: linked_list.cpp:81
T stoi(T... args)
void push_back(int new_elem)
Definition: linked_list.cpp:123
std::shared_ptr< link > search(int find_elem)
Definition: linked_list.cpp:194
T endl(T... args)
-
+
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::link Class Reference
+
+
+
+
The documentation for this class was generated from the following file:
+
+Collaboration diagram for data_structures::linked_list::link:
+
+[legend]
+
+
++Public Member Functions | |
| int | val () |
| std::shared_ptr< link > & | succ () |
| link (int value=0) | |
+Private Attributes | |
| +int | pvalue |
| value of the current link | |
| +std::shared_ptr< link > | psucc |
| pointer to the next value on the list | |
Detailed Description
+A link class containing a value and pointer to another link
+Constructor & Destructor Documentation
+ +◆ link()
+ +
+
+
+
+
+
+
+
|
+ +inlineexplicit | +
Member Function Documentation
+ +◆ succ()
+ +
+
+
+
+
+
+
+
|
+ +inline | +
+
+function returns the pointer to next link
- Returns
- the pointer to the next link
+
+◆ val()
+ +
+
+
+
+
+
+
|
+ +inline | +
+
+function returns the integer value stored in the link.
- Returns
- the integer value stored in the link.
+
+The documentation for this class was generated from the following file:
-
+
- data_structures/linked_list.cpp +
std::shared_ptr< link > psucc
pointer to the next value on the list
Definition: linked_list.cpp:56
int pvalue
value of the current link
Definition: linked_list.cpp:55
-
+
+
- Generated by 1.8.20
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+data_structures::linked_list::link Member List
+
+
+
+This is the complete list of members for data_structures::linked_list::link, including all inherited members.
+| link(int value=0) | data_structures::linked_list::link | inlineexplicit |
| psucc | data_structures::linked_list::link | private |
| pvalue | data_structures::linked_list::link | private |
| succ() | data_structures::linked_list::link | inline |
| val() | data_structures::linked_list::link | inline |
-
+
- Generated by 1.8.20
+
+
Overview
The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
-
+
Features
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
@@ -110,12 +110,12 @@ Features
+
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
+
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.