diff --git a/annotated.html b/annotated.html
new file mode 100644
index 000000000..26bc771f5
--- /dev/null
+++ b/annotated.html
@@ -0,0 +1,150 @@
+
+
+
+Algorithms_in_C++: Class List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here are the classes, structs, unions and interfaces with brief descriptions:
+
+
Algorithms_in_C++: Class Index
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: others/smallest_circle.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Get centre and radius of the smallest circle that circumscribes given set of points.
+More...
+
#include <cmath>#include <iostream>#include <vector>
+
+
Get centre and radius of the smallest circle that circumscribes given set of points.
+
See also other implementation
+
+
+
◆
+
+
+
+
Find the centre and radius of a circle enclosing a set of points.
Parameters
+
+ [in] P vector of points
+
+
+
Returns radius of the circle
+
+
88 double minR = INFINITY;
+
+
+
+
+
+
+
95 for (
size_t i = 0; i < P.
size () - 2; i++)
+
+
97 for (
size_t j = i + 1; j < P.
size (); j++)
+
+
99 for (
size_t k = j + 1;
k < P.
size ();
k ++) {
+
+
+
+
103 C.x = -0.5 * ((P[i].y * (P[j].x * P[j].x + P[j].y * P[j].y -
+
104 P[
k ].x * P[
k ].x - P[
k ].y * P[
k ].y) +
+
105 P[j].y * (P[
k ].x * P[
k ].x + P[
k ].y * P[
k ].y -
+
106 P[i].x * P[i].x - P[i].y * P[i].y) +
+
107 P[
k ].y * (P[i].x * P[i].x + P[i].y * P[i].y -
+
108 P[j].x * P[j].x - P[j].y * P[j].y)) /
+
109 (P[i].x * (P[j].y - P[
k ].y) +
+
110 P[j].x * (P[
k ].y - P[i].y) +
+
111 P[
k ].x * (P[i].y - P[j].y)));
+
112 C.
y = 0.5 * ((P[i].x * (P[j].x * P[j].x + P[j].y * P[j].y -
+
113 P[
k ].x * P[
k ].x - P[
k ].y * P[
k ].y) +
+
114 P[j].x * (P[
k ].x * P[
k ].x + P[
k ].y * P[
k ].y -
+
115 P[i].x * P[i].x - P[i].y * P[i].y) +
+
116 P[
k ].x * (P[i].x * P[i].x + P[i].y * P[i].y -
+
117 P[j].x * P[j].x - P[j].y * P[j].y)) /
+
118 (P[i].x * (P[j].y - P[
k ].y) +
+
119 P[j].x * (P[
k ].y - P[i].y) +
+
120 P[
k ].x * (P[i].y - P[j].y)));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
134 for (
size_t i = 0; i < P.
size () - 1; i++)
+
+
136 for (
size_t j = i + 1; j < P.
size (); j++) {
+
+
138 C.x = (P[i].x + P[j].x) / 2;
+
139 C.
y = (P[i].y + P[j].y) / 2;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double LenghtLine
+ (
+ const Point &
+ A ,
+
+ const Point &
+ B
+
+ )
+
+
+
+
Compute the Euclidian distance between two points \(A\equiv(x_1,y_1)\) and \(B\equiv(x_2,y_2)\) using the formula:
+\[d=\sqrt{\left(x_1-x_2\right)^2+\left(y_1-y_2\right)^2}\]
+
+
Parameters
+
+ [in] A point A [in] B point B
+
+
+
Returns ditance
+
+
38 double dx = B.x - A.x;
+
39 double dy = B.
y - A.
y ;
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool PointInCircle
+ (
+ const std::vector < Point > &
+ P ,
+
+ const Point &
+ Center ,
+
+ double
+ R
+
+ )
+
+
+
+
Check if a set of points lie within given circle. This is true if the distance of all the points from the centre of the circle is less than the radius of the circle
Parameters
+
+ [in] P set of points to check [in] Center coordinates to centre of the circle [in] R radius of the circle
+
+
+
Returns True if P lies on or within the circle
+
+False if P lies outside the circle
+
+
73 for (
size_t i = 0; i < P.
size (); i++) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test
+ (
+ )
+
+
+
+
Test case: result should be:
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ )
+
+
+
+
Test case: result should be:
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test3
+ (
+ )
+
+
+
+
Test case: result should be:
Todo: This test fails
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double TriangleArea
+ (
+ const Point &
+ A ,
+
+ const Point &
+ B ,
+
+ const Point &
+ C
+
+ )
+
+
+
+
Compute the area of triangle formed by three points using Heron's formula . If the lengths of the sides of the triangle are \(a,\,b,\,c\) and \(s=\displaystyle\frac{a+b+c}{2}\) is the semi-perimeter then the area is given by
+\[A=\sqrt{s(s-a)(s-b)(s-c)}\]
+
+
Parameters
+
+ [in] A vertex A [in] B vertex B [in] C vertex C
+
+
+
Returns area of triangle
+
+
+
+
+
58 double p = (
a + b + c) / 2;
+
59 return std::sqrt (p * (p -
a ) * (p - b) * (p - c));
+
+
+
+
+
+
+
+
void test3()
Definition: smallest_circle.cpp:188
void test2()
Definition: smallest_circle.cpp:173
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
ll k
Definition: matrix_exponentiation.cpp:48
double LenghtLine(const Point &A, const Point &B)
Definition: smallest_circle.cpp:37
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition: smallest_circle.cpp:54
double circle(const std::vector< Point > &P)
Definition: smallest_circle.cpp:87
vector< ll > a
Definition: matrix_exponentiation.cpp:53
void test()
Definition: smallest_circle.cpp:158
Definition: line_segment_intersection.cpp:12
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition: smallest_circle.cpp:72
+
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
new file mode 100644
index 000000000..b1ad9e7e3
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -0,0 +1 @@
+65e4cd27339f81a7658d95b7353e141a
\ 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
new file mode 100644
index 000000000..b50d188f5
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -0,0 +1,254 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
new file mode 100644
index 000000000..e9e68db15
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -0,0 +1,166 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map
new file mode 100644
index 000000000..6e26a0361
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5
new file mode 100644
index 000000000..b1f010152
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5
@@ -0,0 +1 @@
+06028b550a4fec7322d81626ff334f78
\ 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
new file mode 100644
index 000000000..0bf474ab5
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg
@@ -0,0 +1,130 @@
+
+
+
+
+
+
+circle
+
+Node1
+
+circle
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+LenghtLine
+
+
+
+
+Node1->Node3
+
+
+
+Node5
+
+PointInCircle
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::vector::size
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+TriangleArea
+
+
+
+
+Node1->Node7
+
+
+
+Node4
+
+std::sqrt
+
+
+
+
+Node3->Node4
+
+
+
+Node5->Node3
+
+
+
+Node5->Node6
+
+
+
+Node7->Node3
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map
new file mode 100644
index 000000000..fe8c04fd2
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5
new file mode 100644
index 000000000..6b8e19d21
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5
@@ -0,0 +1 @@
+c73d30ff9ab210ea6a8ecff5e8f4a3a6
\ 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
new file mode 100644
index 000000000..04a743c4e
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+LenghtLine
+
+Node1
+
+LenghtLine
+
+
+
+
+Node2
+
+std::sqrt
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
new file mode 100644
index 000000000..25d182cd3
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
new file mode 100644
index 000000000..31b2c4997
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
@@ -0,0 +1 @@
+490dfcbbee3c451129fd011a224135ca
\ 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
new file mode 100644
index 000000000..51bb88a88
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
@@ -0,0 +1,254 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
new file mode 100644
index 000000000..49e327817
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
@@ -0,0 +1,166 @@
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map
new file mode 100644
index 000000000..3c4f94f45
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5
new file mode 100644
index 000000000..a94cc831c
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5
@@ -0,0 +1 @@
+0ce4215dafc761fb197d351e877dd9cc
\ 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
new file mode 100644
index 000000000..e3fffe200
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+TriangleArea
+
+Node1
+
+TriangleArea
+
+
+
+
+Node2
+
+LenghtLine
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sqrt
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
new file mode 100644
index 000000000..13e114d6b
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
new file mode 100644
index 000000000..2a08b78ca
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
@@ -0,0 +1 @@
+756e6b6364b0e26f57a06a16541c0208
\ 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
new file mode 100644
index 000000000..30ceafa4f
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
@@ -0,0 +1,254 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
new file mode 100644
index 000000000..5c6dfa406
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
@@ -0,0 +1,166 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+circle
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node1->Node9
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+LenghtLine
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+PointInCircle
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+TriangleArea
+
+
+
+
+Node2->Node8
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node6->Node7
+
+
+
+Node8->Node4
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..a9c0e5846
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,14 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..f6c21bafa
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+2901e10f962428276b67e56b12c17c1d
\ 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
new file mode 100644
index 000000000..1ce62f069
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,341 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+test
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+test2
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test3
+
+
+
+
+Node1->Node12
+
+
+
+Node3->Node2
+
+
+
+Node4
+
+circle
+
+
+
+
+Node3->Node4
+
+
+
+Node10
+
+std::vector::push_back
+
+
+
+
+Node3->Node10
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+LenghtLine
+
+
+
+
+Node4->Node5
+
+
+
+Node7
+
+PointInCircle
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::vector::size
+
+
+
+
+Node4->Node8
+
+
+
+Node9
+
+TriangleArea
+
+
+
+
+Node4->Node9
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7->Node5
+
+
+
+Node7->Node8
+
+
+
+Node9->Node5
+
+
+
+Node11->Node2
+
+
+
+Node11->Node4
+
+
+
+Node11->Node10
+
+
+
+Node12->Node2
+
+
+
+Node12->Node4
+
+
+
+Node12->Node10
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..d94f8b31c
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,253 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+test
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+test2
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test3
+
+
+
+
+Node1->Node12
+
+
+
+Node3->Node2
+
+
+
+Node4
+
+circle
+
+
+
+
+Node3->Node4
+
+
+
+Node10
+
+std::vector::push_back
+
+
+
+
+Node3->Node10
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+LenghtLine
+
+
+
+
+Node4->Node5
+
+
+
+Node7
+
+PointInCircle
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::vector::size
+
+
+
+
+Node4->Node8
+
+
+
+Node9
+
+TriangleArea
+
+
+
+
+Node4->Node9
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7->Node5
+
+
+
+Node7->Node8
+
+
+
+Node9->Node5
+
+
+
+Node11->Node2
+
+
+
+Node11->Node4
+
+
+
+Node11->Node10
+
+
+
+Node12->Node2
+
+
+
+Node12->Node4
+
+
+
+Node12->Node10
+
+
+
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map
new file mode 100644
index 000000000..65d0d1e4a
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5
new file mode 100644
index 000000000..61690f89f
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5
@@ -0,0 +1 @@
+e972b919d295625efef59ee8ac76009f
\ 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
new file mode 100644
index 000000000..aabc4f3cc
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+PointInCircle
+
+Node1
+
+PointInCircle
+
+
+
+
+Node2
+
+LenghtLine
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+std::sqrt
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d0/d04/qr__decompose_8h__incl.map b/d0/d04/qr__decompose_8h__incl.map
new file mode 100644
index 000000000..d3fe3a6f0
--- /dev/null
+++ b/d0/d04/qr__decompose_8h__incl.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d0/d04/qr__decompose_8h__incl.md5 b/d0/d04/qr__decompose_8h__incl.md5
new file mode 100644
index 000000000..27bbe48e6
--- /dev/null
+++ b/d0/d04/qr__decompose_8h__incl.md5
@@ -0,0 +1 @@
+599ef160b12f8482c9fd8de1e6e2183f
\ No newline at end of file
diff --git a/d0/d04/qr__decompose_8h__incl.svg b/d0/d04/qr__decompose_8h__incl.svg
new file mode 100644
index 000000000..ba594118e
--- /dev/null
+++ b/d0/d04/qr__decompose_8h__incl.svg
@@ -0,0 +1,128 @@
+
+
+
+
+
+
+numerical_methods/qr_decompose.h
+
+Node1
+
+numerical_methods/qr
+_decompose.h
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdlib
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iomanip
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+limits
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+numeric
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+valarray
+
+
+
+
+Node1->Node8
+
+
+
diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html
new file mode 100644
index 000000000..3eff47915
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp.html
@@ -0,0 +1,313 @@
+
+
+
+Algorithms_in_C++: math/realtime_stats.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute statistics for data entered in rreal-time.
+More...
+
#include <cassert>#include <cmath>#include <iostream>
+void test_function (const float *test_data, const int number_of_samples) int main (int argc, char **argv)
+
+
Compute statistics for data entered in rreal-time.
+
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.
Author Krishna Vedala
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
Main function
+
+
159 const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
+
160 test_function (test_data1,
sizeof (test_data1) /
sizeof (test_data1[0]));
+
+
+
163 <<
"Enter data. Any non-numeric data will terminate the data input."
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
183 <<
"\tMean: " << stats1.
mean ()
+
184 <<
"\t Variance: " << stats1.
variance ()
+
+
+
187 <<
"\tMean: " << stats2.
mean ()
+
188 <<
"\t Variance: " << stats2.
variance ()
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test_function
+ (
+ const float *
+ test_data ,
+
+ const int
+ number_of_samples
+
+ )
+
+
+
+
Test the algorithm implementation
Parameters
+
+ [in] test_data array of data to test the algorithms
+
+
+
+
119 float mean = 0.f, variance = 0.f;
+
+
+
+
+
124 for (
int i = 0; i < number_of_samples; i++) {
+
+
+
127 mean += test_data[i];
+
+
+
130 mean /= number_of_samples;
+
+
132 for (
int i = 0; i < number_of_samples; i++) {
+
133 float temp = test_data[i] - mean;
+
134 variance += temp * temp;
+
+
136 variance /= number_of_samples;
+
+
+
139 <<
"Expected: Mean: " << mean <<
"\t Variance: " << variance
+
+
+
142 <<
"\tMean: " << stats01.
mean ()
+
143 <<
"\t Variance: " << stats01.
variance ()
+
+
+
146 <<
"\tMean: " << stats02.
mean ()
+
147 <<
"\t Variance: " << stats02.
variance ()
+
+
+
150 assert(std::abs(stats01.
mean () - mean) < 0.01);
+
151 assert(std::abs(stats02.
mean () - mean) < 0.01);
+
152 assert(std::abs(stats02.
variance () - variance) < 0.01);
+
+
+
+
+
+
+
+
+
+
double std() const
Definition: realtime_stats.cpp:48
double variance() const
Definition: realtime_stats.cpp:89
double mean() const
Definition: realtime_stats.cpp:42
Definition: realtime_stats.cpp:72
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
void new_val(T x)
Definition: realtime_stats.cpp:32
void new_val(T x)
Definition: realtime_stats.cpp:77
double variance() const
Definition: realtime_stats.cpp:45
Definition: realtime_stats.cpp:27
double std() const
Definition: realtime_stats.cpp:92
double mean() const
Definition: realtime_stats.cpp:86
+
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..de7c596bd
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+cc77eb4c634a723d383cefcb51fa2331
\ 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
new file mode 100644
index 000000000..e6e3665f2
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,353 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+statistics::stats_computer1
+::mean
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+statistics::stats_computer2
+::mean
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+statistics::stats_computer1
+::new_val
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+statistics::stats_computer2
+::new_val
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+statistics::stats_computer1::std
+
+
+
+
+Node1->Node7
+
+
+
+Node9
+
+statistics::stats_computer1
+::variance
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+statistics::stats_computer2::std
+
+
+
+
+Node1->Node10
+
+
+
+Node11
+
+statistics::stats_computer2
+::variance
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test_function
+
+
+
+
+Node1->Node12
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node7->Node8
+
+
+
+Node7->Node9
+
+
+
+Node10->Node8
+
+
+
+Node10->Node11
+
+
+
+Node12->Node2
+
+
+
+Node12->Node3
+
+
+
+Node12->Node4
+
+
+
+Node12->Node5
+
+
+
+Node12->Node6
+
+
+
+Node12->Node7
+
+
+
+Node12->Node9
+
+
+
+Node12->Node10
+
+
+
+Node12->Node11
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
new file mode 100644
index 000000000..abd3b3e5b
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
@@ -0,0 +1,265 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+statistics::stats_computer1
+::mean
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+statistics::stats_computer2
+::mean
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+statistics::stats_computer1
+::new_val
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+statistics::stats_computer2
+::new_val
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+statistics::stats_computer1::std
+
+
+
+
+Node1->Node7
+
+
+
+Node9
+
+statistics::stats_computer1
+::variance
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+statistics::stats_computer2::std
+
+
+
+
+Node1->Node10
+
+
+
+Node11
+
+statistics::stats_computer2
+::variance
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test_function
+
+
+
+
+Node1->Node12
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node7->Node8
+
+
+
+Node7->Node9
+
+
+
+Node10->Node8
+
+
+
+Node10->Node11
+
+
+
+Node12->Node2
+
+
+
+Node12->Node3
+
+
+
+Node12->Node4
+
+
+
+Node12->Node5
+
+
+
+Node12->Node6
+
+
+
+Node12->Node7
+
+
+
+Node12->Node9
+
+
+
+Node12->Node10
+
+
+
+Node12->Node11
+
+
+
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map
new file mode 100644
index 000000000..d9fab0040
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5
new file mode 100644
index 000000000..2c1dfa465
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5
@@ -0,0 +1 @@
+a30f230da13c6b4cb69f7282591dd48e
\ 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
new file mode 100644
index 000000000..0109c8213
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg
@@ -0,0 +1,196 @@
+
+
+
+
+
+
+test_function
+
+Node1
+
+test_function
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+statistics::stats_computer1
+::mean
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+statistics::stats_computer2
+::mean
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+statistics::stats_computer1
+::new_val
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+statistics::stats_computer2
+::new_val
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+statistics::stats_computer1::std
+
+
+
+
+Node1->Node7
+
+
+
+Node9
+
+statistics::stats_computer1
+::variance
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+statistics::stats_computer2::std
+
+
+
+
+Node1->Node10
+
+
+
+Node11
+
+statistics::stats_computer2
+::variance
+
+
+
+
+Node1->Node11
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node7->Node8
+
+
+
+Node7->Node9
+
+
+
+Node10->Node8
+
+
+
+Node10->Node11
+
+
+
diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html
new file mode 100644
index 000000000..13ab348fe
--- /dev/null
+++ b/d0/d0d/structmst-members.html
@@ -0,0 +1,114 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for mst , including all inherited members.
+
+
+
diff --git a/d0/d1f/structnode__coll__graph.md5 b/d0/d1f/structnode__coll__graph.md5
new file mode 100644
index 000000000..8ff512d43
--- /dev/null
+++ b/d0/d1f/structnode__coll__graph.md5
@@ -0,0 +1 @@
+1518d0a1711ef8fd81e644063ace5d1f
\ No newline at end of file
diff --git a/d0/d1f/structnode__coll__graph.svg b/d0/d1f/structnode__coll__graph.svg
new file mode 100644
index 000000000..ca6f296a5
--- /dev/null
+++ b/d0/d1f/structnode__coll__graph.svg
@@ -0,0 +1,33 @@
+
+
+
+
+
+
+node< Kind >
+
+Node1
+
+node< Kind >
+
+
+
+
+Node1->Node1
+ prev
+next
+right
+left
+link
+
+
+
diff --git a/d0/d55/classcll-members.html b/d0/d55/classcll-members.html
new file mode 100644
index 000000000..03e2accb1
--- /dev/null
+++ b/d0/d55/classcll-members.html
@@ -0,0 +1,122 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for cll , including all inherited members.
+
+ cll () (defined in cll )cll display () (defined in cll )cll find_item (int item_to_find) (defined in cll )cll get_size () (defined in cll )cll head (defined in cll )cll protected insert_front (int new_data) (defined in cll )cll insert_tail (int new_data) (defined in cll )cll operator* () (defined in cll )cll operator++ () (defined in cll )cll total (defined in cll )cll protected ~cll () (defined in cll )cll
+
+
diff --git a/d0/d77/linear__search_8cpp__incl.md5 b/d0/d77/linear__search_8cpp__incl.md5
new file mode 100644
index 000000000..1908e5602
--- /dev/null
+++ b/d0/d77/linear__search_8cpp__incl.md5
@@ -0,0 +1 @@
+e338721c2fe625a63f8de627683e9fd6
\ No newline at end of file
diff --git a/d0/d77/linear__search_8cpp__incl.svg b/d0/d77/linear__search_8cpp__incl.svg
new file mode 100644
index 000000000..750aa6a2f
--- /dev/null
+++ b/d0/d77/linear__search_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+search/linear_search.cpp
+
+Node1
+
+search/linear_search.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html
new file mode 100644
index 000000000..0bbd2356e
--- /dev/null
+++ b/d0/d78/classstatistics_1_1stats__computer1-members.html
@@ -0,0 +1,120 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for statistics::stats_computer1< T > , including all inherited members.
+
+
+
diff --git a/d0/d80/classgraph__coll__graph.md5 b/d0/d80/classgraph__coll__graph.md5
new file mode 100644
index 000000000..f4c8c909a
--- /dev/null
+++ b/d0/d80/classgraph__coll__graph.md5
@@ -0,0 +1 @@
+8a5f1f1eb2d7839c33a123be7f538083
\ No newline at end of file
diff --git a/d0/d80/classgraph__coll__graph.svg b/d0/d80/classgraph__coll__graph.svg
new file mode 100644
index 000000000..2b1e8930e
--- /dev/null
+++ b/d0/d80/classgraph__coll__graph.svg
@@ -0,0 +1,78 @@
+
+
+
+
+
+
+graph
+
+Node1
+
+graph
+
+
+
+
+Node2
+
+std::vector< vector
+< int > >
+
+
+
+
+Node2->Node1
+ adj
+
+
+
+Node3
+
+list< int >
+
+
+
+
+Node3->Node1
+ adj
+
+
+
+Node4
+
+list
+
+
+
+
+Node4->Node3
+ next
+
+
+
+Node4->Node4
+ next
+
+
+
diff --git a/d0/da1/string__fibonacci_8cpp__incl.map b/d0/da1/string__fibonacci_8cpp__incl.map
new file mode 100644
index 000000000..c3953d9db
--- /dev/null
+++ b/d0/da1/string__fibonacci_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d0/da1/string__fibonacci_8cpp__incl.md5 b/d0/da1/string__fibonacci_8cpp__incl.md5
new file mode 100644
index 000000000..f539511cb
--- /dev/null
+++ b/d0/da1/string__fibonacci_8cpp__incl.md5
@@ -0,0 +1 @@
+342f5a7c940b82309c6796ebca39a86d
\ No newline at end of file
diff --git a/d0/da1/string__fibonacci_8cpp__incl.svg b/d0/da1/string__fibonacci_8cpp__incl.svg
new file mode 100644
index 000000000..d9284ed44
--- /dev/null
+++ b/d0/da1/string__fibonacci_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/string_fibonacci.cpp
+
+Node1
+
+math/string_fibonacci.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstring
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html
new file mode 100644
index 000000000..5319de734
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp.html
@@ -0,0 +1,241 @@
+
+
+
+Algorithms_in_C++: math/number_of_positive_divisors.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ Program to calculate number of divisors.
+More...
+
#include <iostream>#include <vector>
+
+
C++ Program to calculate number of divisors.
+
This algorithm use the prime factorization approach. Any number can be written in multiplication of its prime factors.
+
Example:-
+
Similarly if N is -36 at that time number of positive divisors remain same.
+
Example:-
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
71 std::cout <<
"Number of positive divisors is : " ;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int number_of_positive_divisors
+ (
+ int
+ n )
+
+
+
+
Algorithm
+
+
+
36 for (
int i = 2; i * i <= n; i++) {
+
+
+
+
+
+
42 if (prime_count != 0) {
+
43 prime_exponent_count.
push_back (prime_count);
+
+
+
+
+
+
+
50 int divisors_count = 1;
+
+
52 for (
int i = 0; i < prime_exponent_count.
size (); i++) {
+
53 divisors_count = divisors_count * (prime_exponent_count[i] + 1);
+
+
+
56 return divisors_count;
+
+
+
+
+
+
+
+
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
+
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5
new file mode 100644
index 000000000..ba8607281
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5
@@ -0,0 +1 @@
+990829b2cfcf0b4f0baa485c64feba91
\ No newline at end of file
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg
new file mode 100644
index 000000000..332c681ec
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+number_of_positive_divisors
+
+Node1
+
+number_of_positive
+_divisors
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..00d6ae043
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..c40fcb02b
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+4b955f1e80d28c1a99b4f18828e35b90
\ 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
new file mode 100644
index 000000000..09f2192bc
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+number_of_positive
+_divisors
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::vector::push_back
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
diff --git a/d0/dab/interpolation__search_8cpp__incl.map b/d0/dab/interpolation__search_8cpp__incl.map
new file mode 100644
index 000000000..ebdf3a7fa
--- /dev/null
+++ b/d0/dab/interpolation__search_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d0/dab/interpolation__search_8cpp__incl.md5 b/d0/dab/interpolation__search_8cpp__incl.md5
new file mode 100644
index 000000000..5187ea76f
--- /dev/null
+++ b/d0/dab/interpolation__search_8cpp__incl.md5
@@ -0,0 +1 @@
+50f0532822ac20b705aed5ad7bea2748
\ No newline at end of file
diff --git a/d0/dab/interpolation__search_8cpp__incl.svg b/d0/dab/interpolation__search_8cpp__incl.svg
new file mode 100644
index 000000000..f76e11d2e
--- /dev/null
+++ b/d0/dab/interpolation__search_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+search/interpolation_search.cpp
+
+Node1
+
+search/interpolation
+_search.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d0/db5/trie__modern_8cpp__incl.map b/d0/db5/trie__modern_8cpp__incl.map
new file mode 100644
index 000000000..3b3f9c199
--- /dev/null
+++ b/d0/db5/trie__modern_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d0/db5/trie__modern_8cpp__incl.md5 b/d0/db5/trie__modern_8cpp__incl.md5
new file mode 100644
index 000000000..d0d15a284
--- /dev/null
+++ b/d0/db5/trie__modern_8cpp__incl.md5
@@ -0,0 +1 @@
+1439627f44055590d7f63a6ff1ad6c03
\ No newline at end of file
diff --git a/d0/db5/trie__modern_8cpp__incl.svg b/d0/db5/trie__modern_8cpp__incl.svg
new file mode 100644
index 000000000..b349b58f6
--- /dev/null
+++ b/d0/db5/trie__modern_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+data_structures/trie_modern.cpp
+
+Node1
+
+data_structures/trie
+_modern.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+memory
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+string
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html
new file mode 100644
index 000000000..dc89bb8e4
--- /dev/null
+++ b/d0/db6/non__recursive__merge__sort_8cpp.html
@@ -0,0 +1,153 @@
+
+
+
+Algorithms_in_C++: sorting/non_recursive_merge_sort.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <cstddef>#include <iostream>#include <utility>
+ sorting Sorting algorithms.
+template<class Iterator > void sorting::merge (Iterator l, Iterator r, const Iterator e, char b[]) merges 2 sorted adjacent segments into a larger sorted segment More... template<class Iterator > void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n) bottom-up merge sort which sorts elements in a non-decreasing order More... template<class Iterator > void sorting::non_recursive_merge_sort (const Iterator first, const size_t n) bottom-up merge sort which sorts elements in a non-decreasing order More... template<class Iterator > void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last) bottom-up merge sort which sorts elements in a non-decreasing order More... main (int argc, char **argv)
+
+
Copyright 2020
Author Albirair
+
A generic implementation of non-recursive merge sort.
+
+
+
diff --git a/d0/db7/smallest__circle_8cpp__incl.md5 b/d0/db7/smallest__circle_8cpp__incl.md5
new file mode 100644
index 000000000..b7f75904c
--- /dev/null
+++ b/d0/db7/smallest__circle_8cpp__incl.md5
@@ -0,0 +1 @@
+3519d6c8bd7f3487624f46840d81f389
\ No newline at end of file
diff --git a/d0/db7/smallest__circle_8cpp__incl.svg b/d0/db7/smallest__circle_8cpp__incl.svg
new file mode 100644
index 000000000..1fced8040
--- /dev/null
+++ b/d0/db7/smallest__circle_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+others/smallest_circle.cpp
+
+Node1
+
+others/smallest_circle.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html
new file mode 100644
index 000000000..7ab13b7cb
--- /dev/null
+++ b/d0/dc4/struct_point-members.html
@@ -0,0 +1,116 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Point , including all inherited members.
+
+
+
diff --git a/d0/dcc/successive__approximation_8cpp__incl.md5 b/d0/dcc/successive__approximation_8cpp__incl.md5
new file mode 100644
index 000000000..0ac8d2a0a
--- /dev/null
+++ b/d0/dcc/successive__approximation_8cpp__incl.md5
@@ -0,0 +1 @@
+11b6503a2e4cf7f5fd275e8a6254263a
\ No newline at end of file
diff --git a/d0/dcc/successive__approximation_8cpp__incl.svg b/d0/dcc/successive__approximation_8cpp__incl.svg
new file mode 100644
index 000000000..55f580a9a
--- /dev/null
+++ b/d0/dcc/successive__approximation_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+numerical_methods/successive_approximation.cpp
+
+Node1
+
+numerical_methods/successive
+_approximation.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d0/dd1/binaryheap_8cpp__incl.map b/d0/dd1/binaryheap_8cpp__incl.map
new file mode 100644
index 000000000..f2cce02a5
--- /dev/null
+++ b/d0/dd1/binaryheap_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d0/dd1/binaryheap_8cpp__incl.md5 b/d0/dd1/binaryheap_8cpp__incl.md5
new file mode 100644
index 000000000..7f17d389d
--- /dev/null
+++ b/d0/dd1/binaryheap_8cpp__incl.md5
@@ -0,0 +1 @@
+dd50839c38841c72a4716094e86c6cf8
\ No newline at end of file
diff --git a/d0/dd1/binaryheap_8cpp__incl.svg b/d0/dd1/binaryheap_8cpp__incl.svg
new file mode 100644
index 000000000..f99b4e846
--- /dev/null
+++ b/d0/dd1/binaryheap_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+data_structures/binaryheap.cpp
+
+Node1
+
+data_structures/binaryheap.cpp
+
+
+
+
+Node2
+
+climits
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+utility
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d0/dd2/class_queue___array.html b/d0/dd2/class_queue___array.html
new file mode 100644
index 000000000..8f165552e
--- /dev/null
+++ b/d0/dd2/class_queue___array.html
@@ -0,0 +1,148 @@
+
+
+
+Algorithms_in_C++: Queue_Array Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+enqueue (int) dequeue () display ()
+arr = new int[size]
+front rear size
+
The documentation for this class was generated from the following file:
+data_structures/queue_using_array.cpp
+
+
+
+
diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.md5 b/d0/dd5/ode__midpoint__euler_8cpp__incl.md5
new file mode 100644
index 000000000..d7e458f92
--- /dev/null
+++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.md5
@@ -0,0 +1 @@
+1ec8e01f405364078a4c40d5bbc5a6bf
\ No newline at end of file
diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.svg b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg
new file mode 100644
index 000000000..d86c89bba
--- /dev/null
+++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+numerical_methods/ode_midpoint_euler.cpp
+
+Node1
+
+numerical_methods/ode
+_midpoint_euler.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+fstream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+valarray
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/d0/de2/gaussian__elimination_8cpp.html b/d0/de2/gaussian__elimination_8cpp.html
new file mode 100644
index 000000000..436bc3c7d
--- /dev/null
+++ b/d0/de2/gaussian__elimination_8cpp.html
@@ -0,0 +1,226 @@
+
+
+
+Algorithms_in_C++: numerical_methods/gaussian_elimination.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Gaussian elimination method
+More...
+
#include <iostream>
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
10 int mat_size, i, j, step;
+
+
+
+
+
+
16 double **mat =
new double *[mat_size + 1], **x =
new double *[mat_size];
+
17 for (i = 0; i <= mat_size; i++) {
+
18 mat[i] =
new double [mat_size + 1];
+
+
20 x[i] =
new double [mat_size + 1];
+
+
+
+
+
25 for (i = 0; i < mat_size; i++) {
+
26 for (j = 0; j <= mat_size; j++) {
+
+
+
+
+
+
+
33 for (step = 0; step < mat_size - 1; step++) {
+
34 for (i = step; i < mat_size - 1; i++) {
+
35 double a = (mat[i + 1][step] / mat[step][step]);
+
+
37 for (j = step; j <= mat_size; j++)
+
38 mat[i + 1][j] = mat[i + 1][j] - (
a * mat[step][j]);
+
+
+
+
+
43 <<
"Matrix using Gaussian Elimination method: " <<
std::endl ;
+
44 for (i = 0; i < mat_size; i++) {
+
45 for (j = 0; j <= mat_size; j++) {
+
+
+
+
+
+
+
52 <<
"Value of the Gaussian Elimination method: " <<
std::endl ;
+
53 for (i = mat_size - 1; i >= 0; i--) {
+
+
55 for (j = mat_size - 1; j > i; j--) {
+
56 x[i][j] = x[j][j] * x[i][j];
+
+
+
+
+
+
62 x[i][i] = (x[i][mat_size] - sum) / (x[i][i]);
+
+
+
+
+
67 for (i = 0; i <= mat_size; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..86a68ba5f
--- /dev/null
+++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+7b66b13cd9e906646a781de5e20f13d9
\ 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
new file mode 100644
index 000000000..01ecc6aea
--- /dev/null
+++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d0/dfc/sqrt__double_8cpp__incl.map b/d0/dfc/sqrt__double_8cpp__incl.map
new file mode 100644
index 000000000..5581512be
--- /dev/null
+++ b/d0/dfc/sqrt__double_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d0/dfc/sqrt__double_8cpp__incl.md5 b/d0/dfc/sqrt__double_8cpp__incl.md5
new file mode 100644
index 000000000..b3833a6a9
--- /dev/null
+++ b/d0/dfc/sqrt__double_8cpp__incl.md5
@@ -0,0 +1 @@
+564ea8b7518aadf13d9e1028dd086ead
\ No newline at end of file
diff --git a/d0/dfc/sqrt__double_8cpp__incl.svg b/d0/dfc/sqrt__double_8cpp__incl.svg
new file mode 100644
index 000000000..ef8b62c47
--- /dev/null
+++ b/d0/dfc/sqrt__double_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/sqrt_double.cpp
+
+Node1
+
+math/sqrt_double.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d0/dff/structlinkedlist.html b/d0/dff/structlinkedlist.html
new file mode 100644
index 000000000..72a1e7c8b
--- /dev/null
+++ b/d0/dff/structlinkedlist.html
@@ -0,0 +1,131 @@
+
+
+
+Algorithms_in_C++: linkedlist Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The documentation for this struct was generated from the following file:
+data_structures/queue_using_linkedlist.cpp
+
+
+
+
diff --git a/d1/d06/ternary__search_8cpp__incl.md5 b/d1/d06/ternary__search_8cpp__incl.md5
new file mode 100644
index 000000000..925a10bd7
--- /dev/null
+++ b/d1/d06/ternary__search_8cpp__incl.md5
@@ -0,0 +1 @@
+5127eadafd66bb733d2db9106758857d
\ No newline at end of file
diff --git a/d1/d06/ternary__search_8cpp__incl.svg b/d1/d06/ternary__search_8cpp__incl.svg
new file mode 100644
index 000000000..49e234024
--- /dev/null
+++ b/d1/d06/ternary__search_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+search/ternary_search.cpp
+
+Node1
+
+search/ternary_search.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html
new file mode 100644
index 000000000..ee4c6cedd
--- /dev/null
+++ b/d1/d07/class_solution-members.html
@@ -0,0 +1,119 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Solution , including all inherited members.
+
+
Algorithms_in_C++: math/gcd_of_n_numbers.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This program aims at calculating the GCD of n numbers by division method.
+More...
+
#include <iostream>
+int gcd (int *a , int n) int main ()
+
+
This program aims at calculating the GCD of n numbers by division method.
+
See also gcd_iterative_euclidean.cpp , gcd_recursive_euclidean.cpp
+
+
+
◆
+
+
+
+
+
+ int gcd
+ (
+ int *
+ a ,
+
+ int
+ n
+
+ )
+
+
+
+
Compute GCD using division algorithm
+
Parameters
+
+ [in] a array of integers to compute GCD for [in] n number of integers in array a
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
35 for (i = 0; i < n; i++) std::cin >>
a [i];
+
+
+
+
+
+
+
+
+
+
+
+
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
+
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..971396c4b
--- /dev/null
+++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+94566639bee4e32c12e75e423c07d577
\ 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
new file mode 100644
index 000000000..76873384b
--- /dev/null
+++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+gcd
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html
new file mode 100644
index 000000000..c2410c036
--- /dev/null
+++ b/d1/d1d/class_graph-members.html
@@ -0,0 +1,153 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Graph , including all inherited members.
+
+ addEdge (int src, int dst, int weight) (defined in Graph )Graph inline addEdge (int src, int dst, int weight) (defined in Graph )Graph inline addEdge (Edge const &edge)Graph inline addEdge (unsigned int source, unsigned int destination)Graph inline addEdge (int src, int dst, int weight) (defined in Graph )Graph inline addVertices (unsigned int num=1)Graph inline bfs (int source, int sink) (defined in Graph )Graph inline private capacity (defined in Graph )Graph private edge_participated (defined in Graph )Graph private edgeNum (defined in Graph )Graph edges (defined in Graph )Graph edges (defined in Graph )Graph ford_fulkerson (void) (defined in Graph )Graph inline getAdjList () constGraph inline getVertices () constGraph inline Graph (int V, int E) (defined in Graph )Graph inline Graph (int V) (defined in Graph )Graph inline Graph () (defined in Graph )Graph inline Graph (Graph &&)=default (defined in Graph )Graph Graph (Graph const &)=default (defined in Graph )Graph Graph (unsigned int vertices, AdjList const &adjList)Graph inline Graph (unsigned int vertices, AdjList &&adjList)Graph inline Graph (unsigned int vertices, std::vector< Edge > const &edges)Graph inline Graph () (defined in Graph )Graph inline Graph (const int V) (defined in Graph )Graph inline m_adjList (defined in Graph )Graph private m_vertices (defined in Graph )Graph private max_flow (defined in Graph )Graph private operator= (Graph &&)=default (defined in Graph )Graph operator= (Graph const &)=default (defined in Graph )Graph parent (defined in Graph )Graph private print_flow_info (void) (defined in Graph )Graph inline residual_capacity (defined in Graph )Graph private set_graph (void) (defined in Graph )Graph inline sink (defined in Graph )Graph private source (defined in Graph )Graph private total_edges (defined in Graph )Graph private total_nodes (defined in Graph )Graph private vertexNum (defined in Graph )Graph visited (defined in Graph )Graph private ~Graph () (defined in Graph )Graph inline ~Graph ()=default (defined in Graph )Graph
+
+
diff --git a/d1/d1d/pascal__triangle_8cpp__incl.md5 b/d1/d1d/pascal__triangle_8cpp__incl.md5
new file mode 100644
index 000000000..a29dc9e86
--- /dev/null
+++ b/d1/d1d/pascal__triangle_8cpp__incl.md5
@@ -0,0 +1 @@
+6ace10fd060f581b98ff35b936ac7bd9
\ No newline at end of file
diff --git a/d1/d1d/pascal__triangle_8cpp__incl.svg b/d1/d1d/pascal__triangle_8cpp__incl.svg
new file mode 100644
index 000000000..5501da7b5
--- /dev/null
+++ b/d1/d1d/pascal__triangle_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+others/pascal_triangle.cpp
+
+Node1
+
+others/pascal_triangle.cpp
+
+
+
+
+Node2
+
+cstring
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iomanip
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html
new file mode 100644
index 000000000..e683f6c8d
--- /dev/null
+++ b/d1/d21/quick__sort_8cpp.html
@@ -0,0 +1,202 @@
+
+
+
+Algorithms_in_C++: sorting/quick_sort.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Quick sort algorithm.
+More...
+
#include <cstdlib>#include <iostream>
+ sorting Sorting algorithms.
+
+
Quick sort algorithm.
+
Implementation Details - Quick Sort is a divide and conquer algorithm. It picks and element as pivot and partition the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.
+
+Always pick the first element as pivot
+Always pick the last element as pivot (implemented below)
+Pick a random element as pivot
+Pick median as pivot
+
+
The key process in quickSort is partition() . Target of partition is, given an array and an element x(say) of array as pivot, put x at it's correct position in sorted array and put all smaller elements (samller than x) before x, and put all greater elements (greater than x) after x. All this should be done in linear time
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Driver program to test above functions
+
+
+
84 std::cout <<
"\nEnter the number of elements : " ;
+
+
+
+
88 int *arr =
new int [size];
+
+
90 std::cout <<
"\nEnter the unsorted elements : " ;
+
+
92 for (
int i = 0; i < size; ++i) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+
diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..386212bec
--- /dev/null
+++ b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+195146ca207e7e26cca3e48bc27ed907
\ 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
new file mode 100644
index 000000000..95ded9408
--- /dev/null
+++ b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+sorting::quickSort
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+show
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+sorting::partition
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map
new file mode 100644
index 000000000..020cd81ca
--- /dev/null
+++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5
new file mode 100644
index 000000000..05d572c7b
--- /dev/null
+++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5
@@ -0,0 +1 @@
+3342bed250275ada240abc86394a8bff
\ No newline at end of file
diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg
new file mode 100644
index 000000000..5870dd927
--- /dev/null
+++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+numerical_methods/ordinary_least_squares_regressor.cpp
+
+Node1
+
+numerical_methods/ordinary
+_least_squares_regressor.cpp
+
+
+
+
+Node2
+
+iomanip
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d1/d57/classcll__coll__graph.map b/d1/d57/classcll__coll__graph.map
new file mode 100644
index 000000000..b3f79c236
--- /dev/null
+++ b/d1/d57/classcll__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d1/d57/classcll__coll__graph.md5 b/d1/d57/classcll__coll__graph.md5
new file mode 100644
index 000000000..09f1ca9d2
--- /dev/null
+++ b/d1/d57/classcll__coll__graph.md5
@@ -0,0 +1 @@
+30bbcf263db77e073bfe658c330853b3
\ No newline at end of file
diff --git a/d1/d57/classcll__coll__graph.svg b/d1/d57/classcll__coll__graph.svg
new file mode 100644
index 000000000..c88309d21
--- /dev/null
+++ b/d1/d57/classcll__coll__graph.svg
@@ -0,0 +1,49 @@
+
+
+
+
+
+
+cll
+
+Node1
+
+cll
+
+
+
+
+Node2
+
+node< Kind >
+
+
+
+
+Node2->Node1
+ head
+
+
+
+Node2->Node2
+ prev
+next
+right
+left
+link
+
+
+
diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html
new file mode 100644
index 000000000..d2f172310
--- /dev/null
+++ b/d1/d76/buzz__number_8cpp.html
@@ -0,0 +1,169 @@
+
+
+
+Algorithms_in_C++: others/buzz_number.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A buzz number is a number that is either divisible by 7 or has last digit as 7.
+More...
+
#include <iostream>
+
+
A buzz number is a number that is either divisible by 7 or has last digit as 7.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
+
+
14 if ((n % 7 == 0) || (n % 10 == 7))
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..86a68ba5f
--- /dev/null
+++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+7b66b13cd9e906646a781de5e20f13d9
\ 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
new file mode 100644
index 000000000..01ecc6aea
--- /dev/null
+++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html
new file mode 100644
index 000000000..20ed3f2bb
--- /dev/null
+++ b/d1/d77/structmst.html
@@ -0,0 +1,128 @@
+
+
+
+Algorithms_in_C++: mst Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+visited key near
+
The documentation for this struct was generated from the following file:
+greedy_algorithms/prims_minimum_spanning_tree.cpp
+
+
+
+
diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 b/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5
new file mode 100644
index 000000000..a7877157a
--- /dev/null
+++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5
@@ -0,0 +1 @@
+580862ba886f7b9f9ba045d86a092fbc
\ No newline at end of file
diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg
new file mode 100644
index 000000000..29005e2ce
--- /dev/null
+++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+math/gcd_of_n_numbers.cpp
+
+Node1
+
+math/gcd_of_n_numbers.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.map b/d1/da1/decimal__to__hexadecimal_8cpp__incl.map
new file mode 100644
index 000000000..3fcddf9cd
--- /dev/null
+++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 b/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5
new file mode 100644
index 000000000..3c460fabd
--- /dev/null
+++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5
@@ -0,0 +1 @@
+e5e51353a4f5329db132e16456629335
\ No newline at end of file
diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg
new file mode 100644
index 000000000..dc9a12b12
--- /dev/null
+++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/decimal_to_hexadecimal.cpp
+
+Node1
+
+others/decimal_to_hexadecimal.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html
new file mode 100644
index 000000000..95931282d
--- /dev/null
+++ b/d1/db3/structcompare.html
@@ -0,0 +1,122 @@
+
+
+
+Algorithms_in_C++: compare Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The documentation for this struct was generated from the following file:
+greedy_algorithms/huffman.cpp
+
+
+
+
diff --git a/d1/dc2/class_graph__coll__graph.md5 b/d1/dc2/class_graph__coll__graph.md5
new file mode 100644
index 000000000..d8b1e0f88
--- /dev/null
+++ b/d1/dc2/class_graph__coll__graph.md5
@@ -0,0 +1 @@
+e346b070fc6181e5890782d664d2ce7b
\ No newline at end of file
diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg
new file mode 100644
index 000000000..69686204d
--- /dev/null
+++ b/d1/dc2/class_graph__coll__graph.svg
@@ -0,0 +1,123 @@
+
+
+
+
+
+
+Graph
+
+Node1
+
+Graph
+
+
+
+
+Node2
+
+std::bitset< MAXN >
+
+
+
+
+Node2->Node1
+ visited
+
+
+
+Node3
+
+std::vector< std::tuple
+< int, int, int > >
+
+
+
+
+Node3->Node1
+ edge_participated
+
+
+
+Node4
+
+std::tuple< int, int,
+ int >
+
+
+
+
+Node4->Node3
+ elements
+
+
+
+Node5
+
+Edge
+
+
+
+
+Node5->Node1
+ edges
+
+
+
+Node6
+
+std::unordered_map
+< unsigned int, std
+::vector< unsigned int > >
+
+
+
+
+Node6->Node1
+ m_adjList
+
+
+
+Node7
+
+std::vector< unsigned
+ int >
+
+
+
+
+Node7->Node6
+ elements
+
+
+
diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html
new file mode 100644
index 000000000..47bd20a95
--- /dev/null
+++ b/d1/dc2/classstack.html
@@ -0,0 +1,520 @@
+
+
+
+Algorithms_in_C++: stack< Type > Class Template Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ void stack < Type >::clear
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ void stack < Type >::display
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Show stack
+
+
+
+
23 while (current != NULL) {
+
+
25 current = current->next;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ bool stack < Type >::isEmptyStack
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Determine whether the stack is empty
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ stack <Type>& stack < Type >::operator= (
+ const stack < Type > &
+ otherStack )
+
+
+
+
+inline
+
+
+
+
Overload "=" the assignment operator
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
91 current = current->next;
+
+
93 while (current != NULL) {
+
+
95 newNode->data = current->data;
+
+
+
+
99 current = current->next;
+
+
+
102 size = otherStack.size;
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ void stack < Type >::pop
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Remove the top element of the stack
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ void stack < Type >::push
+ (
+ Type
+ item )
+
+
+
+
+inline
+
+
+
+
Add new item to the stack
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ Type stack < Type >::top
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Return the top element of the stack
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
Pointer to the stack
+
+
+
+
The documentation for this class was generated from the following file:
+
+
bool isEmptyStack()
Definition: stack.h:41
node< Type > * stackTop
Definition: stack.h:107
+
diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5
new file mode 100644
index 000000000..d9b2ea3b3
--- /dev/null
+++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5
@@ -0,0 +1 @@
+b7295061875009c161d79592f78f9f93
\ No newline at end of file
diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg
new file mode 100644
index 000000000..481f9f98d
--- /dev/null
+++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+stack::display
+
+Node1
+
+stack::display
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map
new file mode 100644
index 000000000..49e71ebc9
--- /dev/null
+++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5
new file mode 100644
index 000000000..41965e583
--- /dev/null
+++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5
@@ -0,0 +1 @@
+55dba1075d9bb162d99cad94b787eecc
\ No newline at end of file
diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg
new file mode 100644
index 000000000..c97636ba2
--- /dev/null
+++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+stack::pop
+
+Node1
+
+stack::pop
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+stack::isEmptyStack
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d1/dc5/classlarge__number__coll__graph.map b/d1/dc5/classlarge__number__coll__graph.map
new file mode 100644
index 000000000..7618f3a34
--- /dev/null
+++ b/d1/dc5/classlarge__number__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d1/dc5/classlarge__number__coll__graph.md5 b/d1/dc5/classlarge__number__coll__graph.md5
new file mode 100644
index 000000000..80e266986
--- /dev/null
+++ b/d1/dc5/classlarge__number__coll__graph.md5
@@ -0,0 +1 @@
+0e991958ad608f57f8c691742ba4ec9f
\ No newline at end of file
diff --git a/d1/dc5/classlarge__number__coll__graph.svg b/d1/dc5/classlarge__number__coll__graph.svg
new file mode 100644
index 000000000..6bc8fbe6a
--- /dev/null
+++ b/d1/dc5/classlarge__number__coll__graph.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
+
+large_number
+
+Node1
+
+large_number
+
+
+
+
+Node2
+
+std::vector< unsigned
+ char >
+
+
+
+
+Node2->Node1
+ _digits
+
+
+
diff --git a/d1/dda/fast__interger__input_8cpp__incl.map b/d1/dda/fast__interger__input_8cpp__incl.map
new file mode 100644
index 000000000..7bc1b0ed2
--- /dev/null
+++ b/d1/dda/fast__interger__input_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d1/dda/fast__interger__input_8cpp__incl.md5 b/d1/dda/fast__interger__input_8cpp__incl.md5
new file mode 100644
index 000000000..ed6440f55
--- /dev/null
+++ b/d1/dda/fast__interger__input_8cpp__incl.md5
@@ -0,0 +1 @@
+9b2c56b4ddb78fc73944000d83e93239
\ No newline at end of file
diff --git a/d1/dda/fast__interger__input_8cpp__incl.svg b/d1/dda/fast__interger__input_8cpp__incl.svg
new file mode 100644
index 000000000..46f699659
--- /dev/null
+++ b/d1/dda/fast__interger__input_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+others/fast_interger_input.cpp
+
+Node1
+
+others/fast_interger
+_input.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html
new file mode 100644
index 000000000..bbebf3744
--- /dev/null
+++ b/d1/df2/structnode-members.html
@@ -0,0 +1,127 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for node< Kind > , including all inherited members.
+
+
Algorithms_in_C++: search/hash_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Hash Search Algorithm - Best Time Complexity Ω(1)
+More...
+
#include <cstdlib>#include <iostream>
+MAX 6 Determines how much data. HASHMAX 5 Determines the length of the hash table.
+typedef struct list node list * link pointer to nodes
+
+
Hash Search Algorithm - Best Time Complexity Ω(1)
+
Copyright 2020 Arctic2333
+
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.
+
Warning 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.
+
Todo: fix the program for memory leaks and better structure in C++ and not C fashion
+
+
+
◆
+
+
+
+
a one-way linked list define node as one item list
+
+
+
+
+
+
◆
+
+
+
+
+
+ void create_list
+ (
+ int
+ key )
+
+
+
+
The same after the remainder will be added after the same hash header To avoid conflict, zipper method is used Insert elements into the linked list in the header
Parameters
+
+ [in] key key to add to list
+
+
+
Warning dynamic memory allocated to n never gets freed.
+
Todo: fix memory leak
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int h
+ (
+ int
+ key )
+
+
+
+
Mode of hash detection : Division method
Parameters
+
+
+
+
Returns hash value for key
+
+
+
+
+
◆
+
+
+
+
+
+ int hash_search
+ (
+ int
+ key ,
+
+ int *
+ counter
+
+ )
+
+
+
+
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
Returns element depth and number of searches If not found
+
+-1
+
+
+
+
+
+
+
+
+
+
+
86 while (pointer != NULL) {
+
+
88 std::cout <<
"data[" << pointer->key <<
"]:" ;
+
89 if (pointer->key == key)
+
+
+
92 pointer = pointer->next;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
101 int key, index, i, counter;
+
+
+
+
105 while (index <
MAX ) {
+
+
+
+
+
110 for (i = 0; i <
HASHMAX ; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int hash_search(int key, int *counter)
Definition: hash_search.cpp:76
#define HASHMAX
Determines the length of the hash table.
Definition: hash_search.cpp:22
Definition: avltree.cpp:13
#define MAX
Determines how much data.
Definition: hash_search.cpp:21
int h(int key)
Definition: hash_search.cpp:45
struct list * link
pointer to nodes
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
int data[MAX]
test data
Definition: hash_search.cpp:24
void create_list(int key)
Definition: hash_search.cpp:55
+
diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5
new file mode 100644
index 000000000..a627facae
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5
@@ -0,0 +1 @@
+719a0fa1f73cf05c2c7f0bb5818caa70
\ 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
new file mode 100644
index 000000000..b6994f271
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+hash_search
+
+Node1
+
+hash_search
+
+
+
+
+Node2
+
+h
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map
new file mode 100644
index 000000000..042a1bcad
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5
new file mode 100644
index 000000000..d2e21c05c
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5
@@ -0,0 +1 @@
+f486601bc60f8d7e03c49ead19a4d7ae
\ 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
new file mode 100644
index 000000000..78ca68cd0
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+create_list
+
+Node1
+
+create_list
+
+
+
+
+Node2
+
+h
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..70173a737
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..a7619d6a4
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+257a1f3236ed3e891fdced482518fb22
\ 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
new file mode 100644
index 000000000..e46487453
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,88 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+create_list
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+hash_search
+
+
+
+
+Node1->Node5
+
+
+
+Node3
+
+h
+
+
+
+
+Node2->Node3
+
+
+
+Node5->Node3
+
+
+
diff --git a/d1/df9/qr__decomposition_8cpp__incl.map b/d1/df9/qr__decomposition_8cpp__incl.map
new file mode 100644
index 000000000..470fd1f15
--- /dev/null
+++ b/d1/df9/qr__decomposition_8cpp__incl.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d1/df9/qr__decomposition_8cpp__incl.md5 b/d1/df9/qr__decomposition_8cpp__incl.md5
new file mode 100644
index 000000000..0140cb41c
--- /dev/null
+++ b/d1/df9/qr__decomposition_8cpp__incl.md5
@@ -0,0 +1 @@
+9d7124e8d49655be9654967e748b7141
\ No newline at end of file
diff --git a/d1/df9/qr__decomposition_8cpp__incl.svg b/d1/df9/qr__decomposition_8cpp__incl.svg
new file mode 100644
index 000000000..a87a8c5bb
--- /dev/null
+++ b/d1/df9/qr__decomposition_8cpp__incl.svg
@@ -0,0 +1,191 @@
+
+
+
+
+
+
+numerical_methods/qr_decomposition.cpp
+
+Node1
+
+numerical_methods/qr
+_decomposition.cpp
+
+
+
+
+Node2
+
+array
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+iostream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+./qr_decompose.h
+
+
+
+
+Node1->Node7
+
+
+
+Node7->Node3
+
+
+
+Node7->Node4
+
+
+
+Node7->Node6
+
+
+
+Node8
+
+iomanip
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+limits
+
+
+
+
+Node7->Node9
+
+
+
+Node10
+
+numeric
+
+
+
+
+Node7->Node10
+
+
+
+Node11
+
+valarray
+
+
+
+
+Node7->Node11
+
+
+
diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html
new file mode 100644
index 000000000..984cff1fe
--- /dev/null
+++ b/d2/d05/class_min_heap.html
@@ -0,0 +1,478 @@
+
+
+
+Algorithms_in_C++: MinHeap Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+harr pointer to array of elements in heap capacity maximum possible size of min heap heap_size Current number of elements in min heap.
+
+
+
+
◆
+
+
+
+
+
+ MinHeap::MinHeap
+ (
+ int
+ cap )
+
+
+
+
Constructor
Parameters
+
+ [in] capacity initial heap capacity
+
+
+
Constructor: Builds a heap from a given array a[] of given size
+
+
+
+
+
+
◆
+
+
+
+
+
+ void MinHeap::decreaseKey
+ (
+ int
+ i ,
+
+ int
+ new_val
+
+ )
+
+
+
+
Decreases key value of key at index i to new_val
+
Decreases value of key at index 'i' to new_val. It is assumed that new_val is smaller than harr[i].
+
+
+
80 while (i != 0 &&
harr [parent(i)] >
harr [i]) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void MinHeap::deleteKey
+ (
+ int
+ i )
+
+
+
+
Deletes a key stored at index i
+
This function deletes key at index i. It first reduced value to minus infinite, then calls extractMin()
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int MinHeap::extractMin
+ (
+ )
+
+
+
+
to extract the root which is the minimum element
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ int MinHeap::getMin
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Returns the minimum key (key at root) from min heap
+
+
+
+
+
◆
+
+
+
+
+
+ void MinHeap::insertKey
+ (
+ int
+ k )
+
+
+
+
Inserts a new key 'k'
+
+
+
59 std::cout <<
"\nOverflow: Could not insertKey\n" ;
+
+
+
+
+
+
+
+
+
+
69 while (i != 0 &&
harr [parent(i)] >
harr [i]) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ int MinHeap::left
+ (
+ int
+ i )
+
+
+
+
+inline
+
+
+
+
to get index of left child of node at index i
+
28 {
return (2 * i + 1); }
+
+
+
+
+
◆
+
+
+
+
+
+ void MinHeap::MinHeapify
+ (
+ int
+ i )
+
+
+
+
to heapify a subtree with the root at given index
+
A recursive method to heapify a subtree with the root at given index This method assumes that the subtrees are already heapified
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ int MinHeap::right
+ (
+ int
+ i )
+
+
+
+
+inline
+
+
+
+
to get index of right child of node at index i
+
31 {
return (2 * i + 2); }
+
+
+
+
The documentation for this class was generated from the following file:
+
+
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:78
int capacity
maximum possible size of min heap
Definition: binaryheap.cpp:12
ll k
Definition: matrix_exponentiation.cpp:48
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
void MinHeapify(int)
Definition: binaryheap.cpp:115
int left(int i)
Definition: binaryheap.cpp:28
int extractMin()
Definition: binaryheap.cpp:87
int right(int i)
Definition: binaryheap.cpp:31
+
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5
new file mode 100644
index 000000000..8ef426000
--- /dev/null
+++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5
@@ -0,0 +1 @@
+d7d420966366ced62e7494fdc3f920fc
\ 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
new file mode 100644
index 000000000..3648fde4d
--- /dev/null
+++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg
@@ -0,0 +1,206 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+MinHeap::deleteKey
+
+Node1
+
+MinHeap::deleteKey
+
+
+
+
+Node2
+
+MinHeap::decreaseKey
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+MinHeap::extractMin
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+std::swap
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+MinHeap::MinHeapify
+
+
+
+
+Node4->Node5
+
+
+
+Node5->Node3
+
+
+
+Node6
+
+MinHeap::left
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+MinHeap::right
+
+
+
+
+Node5->Node7
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg
new file mode 100644
index 000000000..f81bc8f14
--- /dev/null
+++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg
@@ -0,0 +1,118 @@
+
+
+
+
+
+
+MinHeap::deleteKey
+
+Node1
+
+MinHeap::deleteKey
+
+
+
+
+Node2
+
+MinHeap::decreaseKey
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+MinHeap::extractMin
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+std::swap
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+MinHeap::MinHeapify
+
+
+
+
+Node4->Node5
+
+
+
+Node5->Node3
+
+
+
+Node6
+
+MinHeap::left
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+MinHeap::right
+
+
+
+
+Node5->Node7
+
+
+
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map
new file mode 100644
index 000000000..6abdfb8fe
--- /dev/null
+++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map
@@ -0,0 +1,7 @@
+
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5
new file mode 100644
index 000000000..8b85b181a
--- /dev/null
+++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5
@@ -0,0 +1 @@
+9b19fdb23a0a9a8079b3ebe438c9619d
\ 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
new file mode 100644
index 000000000..b8c036043
--- /dev/null
+++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+MinHeap::extractMin
+
+Node1
+
+MinHeap::extractMin
+
+
+
+
+Node2
+
+MinHeap::MinHeapify
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+MinHeap::left
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+MinHeap::right
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::swap
+
+
+
+
+Node2->Node5
+
+
+
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map
new file mode 100644
index 000000000..797a21fb9
--- /dev/null
+++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5
new file mode 100644
index 000000000..0588920c3
--- /dev/null
+++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5
@@ -0,0 +1 @@
+079abcec8942fce644afc87238869e91
\ 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
new file mode 100644
index 000000000..b11df99e8
--- /dev/null
+++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+MinHeap::decreaseKey
+
+Node1
+
+MinHeap::decreaseKey
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map
new file mode 100644
index 000000000..49f1cbb4d
--- /dev/null
+++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5
new file mode 100644
index 000000000..3f527f7fd
--- /dev/null
+++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5
@@ -0,0 +1 @@
+d5a31c2962558aa0246cb379c189ad01
\ 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
new file mode 100644
index 000000000..3fe34dcbc
--- /dev/null
+++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+MinHeap::MinHeapify
+
+Node1
+
+MinHeap::MinHeapify
+
+
+
+
+Node2
+
+MinHeap::left
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+MinHeap::right
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::swap
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map
new file mode 100644
index 000000000..86877e236
--- /dev/null
+++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5
new file mode 100644
index 000000000..d9cf57624
--- /dev/null
+++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5
@@ -0,0 +1 @@
+6875d5b78d423482dabfbf311d4c6c1c
\ 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
new file mode 100644
index 000000000..ffba3d46e
--- /dev/null
+++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+MinHeap::insertKey
+
+Node1
+
+MinHeap::insertKey
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/d07/class_bit__coll__graph.map b/d2/d07/class_bit__coll__graph.map
new file mode 100644
index 000000000..13af78e54
--- /dev/null
+++ b/d2/d07/class_bit__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d07/class_bit__coll__graph.md5 b/d2/d07/class_bit__coll__graph.md5
new file mode 100644
index 000000000..369b2e8b4
--- /dev/null
+++ b/d2/d07/class_bit__coll__graph.md5
@@ -0,0 +1 @@
+427190570e081c982a2b8e65b94a704c
\ No newline at end of file
diff --git a/d2/d07/class_bit__coll__graph.svg b/d2/d07/class_bit__coll__graph.svg
new file mode 100644
index 000000000..3fa569ee7
--- /dev/null
+++ b/d2/d07/class_bit__coll__graph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+Bit
+
+Node1
+
+Bit
+
+
+
+
+Node2
+
+std::vector< int >
+
+
+
+
+Node2->Node1
+ bit
+
+
+
diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html
new file mode 100644
index 000000000..94ece4adc
--- /dev/null
+++ b/d2/d0b/fast__power_8cpp.html
@@ -0,0 +1,301 @@
+
+
+
+Algorithms_in_C++: math/fast_power.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Faster computation for \(a^b\).
+More...
+
#include <cassert>#include <cmath>#include <cstdint>#include <cstdlib>#include <ctime>#include <iostream>
+
+
Faster computation for \(a^b\).
+
Program that computes \(a^b\) in \(O(logN)\) time. It is based on formula that:
+if \(b\) is even: \(a^b = a^\frac{b}{2} \cdot a^\frac{b}{2} = {a^\frac{b}{2}}^2\)
+if \(b\) is odd: \(a^b = a^\frac{b-1}{2} \cdot a^\frac{b-1}{2} \cdot a = {a^\frac{b-1}{2}}^2 \cdot a\)
+
+
We can compute \(a^b\) recursively using above algorithm.
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ double fast_power_linear
+ (
+ T
+ a ,
+
+ T
+ b
+
+ )
+
+
+
+
Same algorithm with little different formula. It still calculates in \(O(\log N)\)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ double fast_power_recursive
+ (
+ T
+ a ,
+
+ T
+ b
+
+ )
+
+
+
+
algorithm implementation for \(a^b\)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
39 result = bottom * bottom;
+
+
41 result = bottom * bottom *
a ;
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
73 for (
int i = 0; i < 20; i++) {
+
+
+
+
+
+
+
80 std::cout <<
"------ " <<
a <<
"^" << b <<
" = "
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
double fast_power_recursive(T a, T b)
Definition: fast_power.cpp:26
vector< ll > a
Definition: matrix_exponentiation.cpp:53
T sync_with_stdio(T... args)
double fast_power_linear(T a, T b)
Definition: fast_power.cpp:50
+
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..737ff6ca1
--- /dev/null
+++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+8a1526b892acf3677d45092bf0fcc1d3
\ 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
new file mode 100644
index 000000000..6df3a644e
--- /dev/null
+++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::srand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::ios_base::sync
+_with_stdio
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::time
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html
new file mode 100644
index 000000000..2c4b8d81a
--- /dev/null
+++ b/d2/d22/jump__search_8cpp.html
@@ -0,0 +1,209 @@
+
+
+
+Algorithms_in_C++: search/jump_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ program to implement Jump Search
+More...
+
#include <algorithm>#include <cmath>#include <iostream>
+int jumpSearch (int arr[], int x, int n) main ()
+
+
C++ program to implement Jump Search
+
+
+
◆
+
+
+
+
+
+ int jumpSearch
+ (
+ int
+ arr [],
+
+ int
+ x ,
+
+ int
+ n
+
+ )
+
+
+
+
jump search implementation
+
+
+
+
+
+
+
+
19 while (arr[
std::min (step, n) - 1] < x) {
+
+
+
+
+
+
+
+
+
28 while (arr[prev] < x) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5
new file mode 100644
index 000000000..636fe69fc
--- /dev/null
+++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5
@@ -0,0 +1 @@
+3d29fd226e8064ba8d60b92772c69ca1
\ 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
new file mode 100644
index 000000000..97da7a166
--- /dev/null
+++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+jumpSearch
+
+Node1
+
+jumpSearch
+
+
+
+
+Node2
+
+std::min
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sqrt
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d2/d26/addition__rule_8cpp__incl.map b/d2/d26/addition__rule_8cpp__incl.map
new file mode 100644
index 000000000..5781a943a
--- /dev/null
+++ b/d2/d26/addition__rule_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d26/addition__rule_8cpp__incl.md5 b/d2/d26/addition__rule_8cpp__incl.md5
new file mode 100644
index 000000000..627de54ae
--- /dev/null
+++ b/d2/d26/addition__rule_8cpp__incl.md5
@@ -0,0 +1 @@
+371f2e285309605032bf7f2e037859fb
\ No newline at end of file
diff --git a/d2/d26/addition__rule_8cpp__incl.svg b/d2/d26/addition__rule_8cpp__incl.svg
new file mode 100644
index 000000000..c558d67b6
--- /dev/null
+++ b/d2/d26/addition__rule_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+probability/addition_rule.cpp
+
+Node1
+
+probability/addition
+_rule.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html
new file mode 100644
index 000000000..745019614
--- /dev/null
+++ b/d2/d2c/structtower.html
@@ -0,0 +1,129 @@
+
+
+
+Algorithms_in_C++: tower Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+values [10] Values in the tower. top top tower ID
+
+
Define the state of tower
+
The documentation for this struct was generated from the following file:
+
+
Algorithms_in_C++: queue< Kind > Class Template Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <queue.h >
+
+
+
+node * t [100] front rear
+
+
template<class Kind>
+
+
Definition of the queue class
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ void queue < Kind >::clear
+ (
+ )
+
+
+
+
+inline
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ void queue < Kind >::deQueue
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Remove the top element of the queue
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ void queue < Kind >::display
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Show queue
+
+
+
+
23 while (current != NULL) {
+
+
25 current = current->next;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ void queue < Kind >::enQueue
+ (
+ Kind
+ item )
+
+
+
+
+inline
+
+
+
+
Add new item to the queue
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ Kind queue < Kind >::front
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Return the first element of the queue
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ bool queue < Kind >::isEmptyQueue
+ (
+ )
+
+
+
+
+inline
+
+
+
+
Determine whether the queue is empty
+
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
+
+
+ node <Kind>* queue < Kind >::queueFront
+
+
+
+private
+
+
+
+
Pointer to the front of the queue
+
+
+
+
+
◆
+
+
+
+
+template<class Kind >
+
+
+
Pointer to the rear of the queue
+
+
+
+
The documentation for this class was generated from the following files:
+
+
Definition: avltree.cpp:13
node< Kind > * queueRear
Definition: queue.h:84
bool isEmptyQueue()
Definition: queue.h:42
node< Kind > * queueFront
Definition: queue.h:83
+
diff --git a/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5
new file mode 100644
index 000000000..98bd7110a
--- /dev/null
+++ b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5
@@ -0,0 +1 @@
+f187d2ce1ee81ebaf9b9eec3a9b6d3b3
\ No newline at end of file
diff --git a/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg
new file mode 100644
index 000000000..ab02e3f55
--- /dev/null
+++ b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+queue::deQueue
+
+Node1
+
+queue::deQueue
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+queue::isEmptyQueue
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map
new file mode 100644
index 000000000..f5560df96
--- /dev/null
+++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5
new file mode 100644
index 000000000..5ad74c8c0
--- /dev/null
+++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5
@@ -0,0 +1 @@
+28b222a5f48788cf436ad67126641845
\ No newline at end of file
diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg
new file mode 100644
index 000000000..9c4bcb3c4
--- /dev/null
+++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+queue::display
+
+Node1
+
+queue::display
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm.html b/d2/d3b/namespaceqr__algorithm.html
new file mode 100644
index 000000000..de9940b34
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm.html
@@ -0,0 +1,634 @@
+
+
+
+Algorithms_in_C++: qr_algorithm Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions to compute QR decomposition of any rectangular matrix.
+More...
+
+
+
Functions to compute QR decomposition of any rectangular matrix.
+
+
+
◆
+
+
+
+
Compute eigen values using iterative shifted QR decomposition algorithm as follows:
+Use last diagonal element of A as eigen value approximation \(c\)
+Shift diagonals of matrix \(A' = A - cI\)
+Decompose matrix \(A'=QR\)
+Compute next approximation \(A'_1 = RQ \)
+Shift diagonals back \(A_1 = A'_1 + cI\)
+Termination condition check: last element below diagonal is almost 0
+If not 0, go back to step 1 with the new approximation \(A_1\)
+If 0, continue to step 7
+
+
+Save last known \(c\) as the eigen value.
+Are all eigen values found?
+If not, remove last row and column of \(A_1\) and go back to step 1.
+If yes, stop.
+
+
+
+
Note The matrix \(A\) gets modified
+
Parameters
+
+ [in,out] A matrix to compute eigen values for [in] print_intermediates (optional) whether to print intermediate A, Q and R matrices (default = false)
+
+
+
+
100 int rows = A->size();
+
+
102 int counter = 0, num_eigs = rows - 1;
+
+
+
+
+
+
+
+
110 for (
int i = 0; i < rows; i++) {
+
+
+
+
+
+
116 while (num_eigs > 0) {
+
+
118 while (std::abs(A[0][num_eigs][num_eigs - 1]) >
+
+
+
121 last_eig = A[0][num_eigs][num_eigs];
+
122 for (
int i = 0; i < rows; i++) {
+
123 A[0][i][i] -= last_eig;
+
+
+
+
+
128 if (print_intermediates) {
+
+
+
+
132 printf (
"-------------------- %d ---------------------\n" ,
+
+
+
+
+
+
+
139 for (
int i = 0; i < rows; i++) {
+
140 A[0][i][i] += last_eig;
+
+
+
+
+
145 eigen_vals[num_eigs] = last_eig;
+
+
147 if (print_intermediates) {
+
148 std::cout <<
"========================\n" ;
+
149 std::cout <<
"Eigen value: " << last_eig <<
",\n" ;
+
150 std::cout <<
"========================\n" ;
+
+
+
+
+
+
+
157 eigen_vals[0] = A[0][0][0];
+
+
159 if (print_intermediates) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
+template<typename T >
+
+
+
operator to print a matrix
+
+
+
36 const char separator =
' ' ;
+
+
+
39 for (
size_t row = 0; row < v.size(); row++) {
+
40 for (
size_t col = 0; col < v[row].size(); col++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
+template<typename T >
+
+
+
operator to print a vector
+
+
+
55 const char separator =
' ' ;
+
+
+
58 for (
size_t row = 0; row < v.size(); row++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Decompose matrix \(A\) using Gram-Schmidt process .
+
+\begin{eqnarray*} \text{given that}\quad A &=& *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\ \text{where}\quad\mathbf{a}_i &=& \left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column vectors)}\\ \text{then}\quad\mathbf{u}_i &=& \mathbf{a}_i *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\ \mathbf{e}_i &=&\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\ Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots & \mathbf{e}_{N-1}\end{bmatrix}\\ R &=& \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\ 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ \vdots & \vdots & \vdots & \ddots \end{bmatrix}\\ \end{eqnarray*}
+
+
Parameters
+
+ A input matrix to decompose Q output decomposed matrix R output decomposed matrix
+
+
+
+
+
+
+
+
+
+
157 for (
int i = 0; i < COLUMNS; i++) {
+
+
+
+
+
+
+
+
+
+
167 for (j = 0; j < ROWS; j++) {
+
168 tmp_vector[j] = A[j][i];
+
169 col_vector[j] = A[j][i];
+
+
171 for (j = 0; j < i; j++) {
+
172 for (
int k = 0;
k < ROWS;
k ++) {
+
173 col_vector2[
k ] = Q[0][
k ][j];
+
+
175 col_vector2 =
vector_proj (col_vector, col_vector2);
+
176 tmp_vector -= col_vector2;
+
+
+
+
+
+
+
+
+
185 for (j = 0; j < ROWS; j++) Q[0][j][i] = tmp_vector[j] / mag;
+
+
+
+
+
+
+
192 for (
int kk = 0; kk < ROWS; kk++) {
+
193 col_vector[kk] = Q[0][kk][i];
+
+
+
+
+
+
+
200 for (
int k = i;
k < COLUMNS;
k ++) {
+
201 for (
int kk = 0; kk < ROWS; kk++) {
+
202 col_vector2[kk] = A[kk][
k ];
+
+
204 R[0][i][
k ] = (col_vector * col_vector2).sum();
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
+
+
+ double qr_algorithm::vector_dot
+ (
+ const std::valarray < T > &
+ a ,
+
+ const std::valarray < T > &
+ b
+
+ )
+
+
+
+
+inline
+
+
+
+
Compute dot product of two vectors of equal lengths
+
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\)
+
Returns \(\vec{a}\cdot\vec{b}\)
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
+
+
+ double qr_algorithm::vector_mag
+ (
+ const std::valarray < T > &
+ a )
+
+
+
+
+inline
+
+
+
+
Compute magnitude of vector.
+
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}\)
+
Returns \(\left|\vec{a}\right|\)
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Compute projection of vector \(\vec{a}\) on \(\vec{b}\) defined as
+\[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\]
+
+
Returns NULL if error, otherwise pointer to output
+
check for division by zero using machine epsilon
+
+
+
+
+
+
+
111 std::cerr <<
"[" << __func__ <<
"] Possible division by zero\n" ;
+
+
+
+
115 double scalar = num / deno;
+
+
+
+
+
+
+
+
void mat_mul(const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT)
Definition: qr_eigen_values.cpp:54
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
double vector_mag(const std::valarray< T > &a)
Definition: qr_decompose.h:92
ll k
Definition: matrix_exponentiation.cpp:48
vector< ll > a
Definition: matrix_exponentiation.cpp:53
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:76
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+
diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5
new file mode 100644
index 000000000..b9df66db3
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5
@@ -0,0 +1 @@
+c188dd63efb3bd8c28af5b09f11c458a
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg
new file mode 100644
index 000000000..9cdd4eb84
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+qr_algorithm::operator<<
+
+Node1
+
+qr_algorithm::operator<<
+
+
+
+
+Node2
+
+std::right
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::setfill
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::setw
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map
new file mode 100644
index 000000000..d24d7d7b4
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5
new file mode 100644
index 000000000..a1c4e0099
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5
@@ -0,0 +1 @@
+3c8195a16666a20a829d5692b1be9d34
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg
new file mode 100644
index 000000000..0ed72128d
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg
@@ -0,0 +1,201 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+qr_algorithm::eigen_values
+
+Node1
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node2
+
+mat_mul
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+qr_algorithm::vector_mag
+
+
+
+
+Node3->Node4
+
+
+
+Node7
+
+qr_algorithm::vector_proj
+
+
+
+
+Node3->Node7
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::vector_dot
+
+
+
+
+Node4->Node6
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg
new file mode 100644
index 000000000..1196c1abf
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg
@@ -0,0 +1,113 @@
+
+
+
+
+
+
+qr_algorithm::eigen_values
+
+Node1
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node2
+
+mat_mul
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+qr_algorithm::vector_mag
+
+
+
+
+Node3->Node4
+
+
+
+Node7
+
+qr_algorithm::vector_proj
+
+
+
+
+Node3->Node7
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::vector_dot
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map
new file mode 100644
index 000000000..da130d912
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5
new file mode 100644
index 000000000..7009851dd
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5
@@ -0,0 +1 @@
+26dca506326fcc0e84fc34700e6006ca
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg
new file mode 100644
index 000000000..ddd21d6c9
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+qr_algorithm::operator<<
+
+Node1
+
+qr_algorithm::operator<<
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::right
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::setfill
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::setw
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map
new file mode 100644
index 000000000..2fbb754d5
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5
new file mode 100644
index 000000000..942ffe2e9
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5
@@ -0,0 +1 @@
+5316cb853ca8b338ac154ba9b430dee4
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg
new file mode 100644
index 000000000..e81748c9b
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+qr_algorithm::qr_decompose
+
+Node1
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node2
+
+qr_algorithm::vector_mag
+
+
+
+
+Node1->Node2
+
+
+
+Node5
+
+qr_algorithm::vector_proj
+
+
+
+
+Node1->Node5
+
+
+
+Node3
+
+std::sqrt
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+qr_algorithm::vector_dot
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map
new file mode 100644
index 000000000..7e8a08cfb
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5
new file mode 100644
index 000000000..4747a41bd
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5
@@ -0,0 +1 @@
+2e215d06c8343f47b8ed9e40ac51a001
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg
new file mode 100644
index 000000000..d72fc49e1
--- /dev/null
+++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+qr_algorithm::vector_mag
+
+Node1
+
+qr_algorithm::vector_mag
+
+
+
+
+Node2
+
+std::sqrt
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+qr_algorithm::vector_dot
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d2/d66/binary__search_8cpp__incl.map b/d2/d66/binary__search_8cpp__incl.map
new file mode 100644
index 000000000..0da15b325
--- /dev/null
+++ b/d2/d66/binary__search_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d2/d66/binary__search_8cpp__incl.md5 b/d2/d66/binary__search_8cpp__incl.md5
new file mode 100644
index 000000000..56067daba
--- /dev/null
+++ b/d2/d66/binary__search_8cpp__incl.md5
@@ -0,0 +1 @@
+0bb21284fc3084cdc006e78d52ed1561
\ No newline at end of file
diff --git a/d2/d66/binary__search_8cpp__incl.svg b/d2/d66/binary__search_8cpp__incl.svg
new file mode 100644
index 000000000..505709a11
--- /dev/null
+++ b/d2/d66/binary__search_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+search/binary_search.cpp
+
+Node1
+
+search/binary_search.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/d89/median__search_8cpp__incl.map b/d2/d89/median__search_8cpp__incl.map
new file mode 100644
index 000000000..994163d7a
--- /dev/null
+++ b/d2/d89/median__search_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d2/d89/median__search_8cpp__incl.md5 b/d2/d89/median__search_8cpp__incl.md5
new file mode 100644
index 000000000..2da10a2dd
--- /dev/null
+++ b/d2/d89/median__search_8cpp__incl.md5
@@ -0,0 +1 @@
+88dfec9ce92bf01fc71095ea717fc950
\ No newline at end of file
diff --git a/d2/d89/median__search_8cpp__incl.svg b/d2/d89/median__search_8cpp__incl.svg
new file mode 100644
index 000000000..a89738904
--- /dev/null
+++ b/d2/d89/median__search_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+search/median_search.cpp
+
+Node1
+
+search/median_search.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html
new file mode 100644
index 000000000..14fb0c0b4
--- /dev/null
+++ b/d2/dc4/classstack__linked_list.html
@@ -0,0 +1,144 @@
+
+
+
+Algorithms_in_C++: stack_linkedList Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+enqueue (int) dequeue () display ()
+
The documentation for this class was generated from the following file:
+data_structures/queue_using_linkedlist.cpp
+
+
+
Algorithms_in_C++: statistics Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Statistical algorithms.
+More...
+
+
+
Statistical algorithms.
+
+
+
diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.md5 b/d2/ddd/gaussian__elimination_8cpp__incl.md5
new file mode 100644
index 000000000..669b5696f
--- /dev/null
+++ b/d2/ddd/gaussian__elimination_8cpp__incl.md5
@@ -0,0 +1 @@
+1204bbacecdb09d77f6d02ecdbb061cc
\ No newline at end of file
diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.svg b/d2/ddd/gaussian__elimination_8cpp__incl.svg
new file mode 100644
index 000000000..c72117346
--- /dev/null
+++ b/d2/ddd/gaussian__elimination_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+numerical_methods/gaussian_elimination.cpp
+
+Node1
+
+numerical_methods/gaussian
+_elimination.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d2/def/prime__factorization_8cpp__incl.map b/d2/def/prime__factorization_8cpp__incl.map
new file mode 100644
index 000000000..3cd7966cf
--- /dev/null
+++ b/d2/def/prime__factorization_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d2/def/prime__factorization_8cpp__incl.md5 b/d2/def/prime__factorization_8cpp__incl.md5
new file mode 100644
index 000000000..fcb9ce15c
--- /dev/null
+++ b/d2/def/prime__factorization_8cpp__incl.md5
@@ -0,0 +1 @@
+8c662fca52c008d09b615fd2f3632535
\ No newline at end of file
diff --git a/d2/def/prime__factorization_8cpp__incl.svg b/d2/def/prime__factorization_8cpp__incl.svg
new file mode 100644
index 000000000..557fbd493
--- /dev/null
+++ b/d2/def/prime__factorization_8cpp__incl.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+math/prime_factorization.cpp
+
+Node1
+
+math/prime_factorization.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstring
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.html b/d3/d06/ode__semi__implicit__euler_8cpp.html
new file mode 100644
index 000000000..66572eeb1
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp.html
@@ -0,0 +1,414 @@
+
+
+
+Algorithms_in_C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
+More...
+
#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>
+void problem (const double &x, std::valarray < double > *y, std::valarray < double > *dy) Problem statement for a system with first-order differential equations. Updates the system differential variables. More... void exact_solution (const double &x, std::valarray < double > *y) Exact solution of the problem. Used for solution comparison. More... void semi_implicit_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the semi-implicit-Euler method. More... double semi_implicit_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the semi-implicit-Euler method in the given limits. More... void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray < double > &Y0) int main (int argc, char *argv[])
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
+
Authors Krishna Vedala
+
The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*}
+
+
The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*}
+
+
The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison.
+
To implement Van der Pol oscillator , change the problem function to:
const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also ode_midpoint_euler.cpp , ode_forward_euler.cpp
+
+
+
◆
+
+
+
+
+
+ void exact_solution
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y
+
+ )
+
+
+
+
+
Exact solution of the problem. Used for solution comparison.
+
Parameters
+
+ [in] x independent variable [in,out] y dependent variable
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
Main Function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
205 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void problem
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+
Note This function can be updated to and ode of any order.
+
Parameters
+
+ [in] x independent variable(s) [in,out] y dependent variable(s) [in,out] dy first-derivative of dependent variable(s)
+
+
+
+
55 const double omega = 1.F;
+
+
57 dy[0][1] = -omega * omega * y[0][0];
+
+
+
+
+
+
◆
+
+
+
+
+
+ void save_exact_solution
+ (
+ const double &
+ X0 ,
+
+ const double &
+ X_MAX ,
+
+ const double &
+ step_size ,
+
+ const std::valarray < double > &
+ Y0
+
+ )
+
+
+
+
Function to compute and save exact solution for comparison
+
Parameters
+
+ [in] X0 initial value of independent variable [in] X_MAX final value of independent variable [in] step_size independent variable step size [in] Y0 initial values of dependent variables
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
169 for (
int i = 0; i < y.size() - 1; i++) {
+
+
+
172 fp << y[y.size() - 1] <<
"\n" ;
+
+
+
+
+
177 }
while (x <= X_MAX);
+
+
+
180 double total_time =
static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
181 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the semi-implicit-Euler method in the given limits.
Definition: ode_semi_implicit_euler.cpp:103
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_semi_implicit_euler.cpp:153
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_semi_implicit_euler.cpp:66
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..98683141f
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+dd6b81afcc106a1b6ef510c853a38728
\ 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
new file mode 100644
index 000000000..6be80e886
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,241 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::atof
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+save_exact_solution
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+semi_implicit_euler
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+std::clock
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::ofstream::close
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+exact_solution
+
+
+
+
+Node3->Node6
+
+
+
+Node9
+
+std::ofstream::is_open
+
+
+
+
+Node3->Node9
+
+
+
+Node10
+
+std::perror
+
+
+
+
+Node3->Node10
+
+
+
+Node7
+
+std::cos
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::sin
+
+
+
+
+Node6->Node8
+
+
+
+Node11->Node4
+
+
+
+Node11->Node5
+
+
+
+Node11->Node9
+
+
+
+Node11->Node10
+
+
+
+Node12
+
+std::ofstream::open
+
+
+
+
+Node11->Node12
+
+
+
+Node13
+
+semi_implicit_euler_step
+
+
+
+
+Node11->Node13
+
+
+
+Node14
+
+problem
+
+
+
+
+Node13->Node14
+
+
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
new file mode 100644
index 000000000..ee5a8e0c5
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
new file mode 100644
index 000000000..417921570
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
@@ -0,0 +1 @@
+0881ed8175bf272a83fbca20823466f2
\ 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
new file mode 100644
index 000000000..943566dbb
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+save_exact_solution
+
+Node1
+
+save_exact_solution
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+exact_solution
+
+
+
+
+Node1->Node4
+
+
+
+Node7
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::perror
+
+
+
+
+Node1->Node8
+
+
+
+Node5
+
+std::cos
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::sin
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
new file mode 100644
index 000000000..fbb37ebae
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
new file mode 100644
index 000000000..53dab073e
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
@@ -0,0 +1 @@
+28f68d690a34e83ed529b0e7cf875a9c
\ 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
new file mode 100644
index 000000000..6b0aebf2e
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+exact_solution
+
+Node1
+
+exact_solution
+
+
+
+
+Node2
+
+std::cos
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sin
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d19/sparse__matrix_8cpp.html b/d3/d19/sparse__matrix_8cpp.html
new file mode 100644
index 000000000..7737b1ea4
--- /dev/null
+++ b/d3/d19/sparse__matrix_8cpp.html
@@ -0,0 +1,188 @@
+
+
+
+Algorithms_in_C++: others/sparse_matrix.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <iostream>
+
+
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.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
+
13 std::cout <<
"Enter dimensions of matrix (seperated with space): " ;
+
+
+
+
17 int **
a =
new int *[m];
+
18 for (
int i = 0; i < m; i++)
a [i] =
new int [n];
+
+
+
+
+
+
24 for (
int i = 0; i < m; i++) {
+
25 for (
int j = 0; j < n; j++) {
+
+
+
+
+
+
+
32 for (
int i = 0; i < m; i++) {
+
33 for (
int j = 0; j < n; j++) {
+
+
+
+
+
+
+
40 if (counterZeros > ((m * n) / 2))
+
+
+
+
+
45 for (
int i = 0; i < m; i++)
delete []
a [i];
+
+
+
+
+
+
+
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5
new file mode 100644
index 000000000..1f02a3fc3
--- /dev/null
+++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5
@@ -0,0 +1 @@
+c690165bd3e35d89189fe64620f731ad
\ No newline at end of file
diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg
new file mode 100644
index 000000000..a3d483c13
--- /dev/null
+++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+math/modular_inverse_fermat_little_theorem.cpp
+
+Node1
+
+math/modular_inverse
+_fermat_little_theorem.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d24/qr__decomposition_8cpp.html b/d3/d24/qr__decomposition_8cpp.html
new file mode 100644
index 000000000..0f88a55d8
--- /dev/null
+++ b/d3/d24/qr__decomposition_8cpp.html
@@ -0,0 +1,203 @@
+
+
+
+Algorithms_in_C++: numerical_methods/qr_decomposition.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Program to compute the QR decomposition of a given matrix.
+More...
+
#include <array>
+
#include <cmath>
+
#include <cstdlib>
+
#include <ctime>
+
#include <iostream>
+
#include "./qr_decompose.h "
+
+
+
Program to compute the QR decomposition of a given matrix.
+
Author Krishna Vedala
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
main function
+
+
24 unsigned int ROWS, COLUMNS;
+
+
26 std::cout <<
"Enter the number of rows and columns: " ;
+
+
+
29 std::cout <<
"Enter matrix elements row-wise:\n" ;
+
+
+
+
+
34 for (
int i = 0; i <
std::max (ROWS, COLUMNS); i++) {
+
+
+
+
+
+
+
+
+
+
44 for (
int i = 0; i < ROWS; i++)
+
45 for (
int j = 0; j < COLUMNS; j++) std::cin >> A[i][j];
+
+
+
+
+
+
51 double dtime =
static_cast< double > (
clock () - t1) / CLOCKS_PER_SEC;
+
+
+
+
55 std::cout <<
"Time taken to compute: " << dtime <<
" sec\n " ;
+
+
+
+
+
+
+
+
+
+
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
new file mode 100644
index 000000000..e4b2c5723
--- /dev/null
+++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
@@ -0,0 +1 @@
+f7a8cceeb1ccef61420e5d6bfbcd057b
\ 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
new file mode 100644
index 000000000..8faff1bc4
--- /dev/null
+++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
@@ -0,0 +1,200 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::max
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+qr_algorithm::vector_mag
+
+
+
+
+Node3->Node4
+
+
+
+Node7
+
+qr_algorithm::vector_proj
+
+
+
+
+Node3->Node7
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::vector_dot
+
+
+
+
+Node4->Node6
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
new file mode 100644
index 000000000..1e7538cb4
--- /dev/null
+++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::max
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+qr_algorithm::vector_mag
+
+
+
+
+Node3->Node4
+
+
+
+Node7
+
+qr_algorithm::vector_proj
+
+
+
+
+Node3->Node7
+
+
+
+Node5
+
+std::sqrt
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::vector_dot
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html
new file mode 100644
index 000000000..446911c0c
--- /dev/null
+++ b/d3/d26/binary__search__tree_8cpp.html
@@ -0,0 +1,174 @@
+
+
+
+Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A simple tree implementation using structured nodes.
+More...
+
#include <iostream>
+enqueue (node *n) node * dequeue () Insert (node *n, int x) findMaxInLeftST (node *n) Remove (node *p, node *n, int x) BFT (node *n) Pre (node *n) In (node *n) Post (node *n) main ()
+
+
A simple tree implementation using structured nodes.
+
Todo: update code to use C++ STL library features and OO structure
+
Warning This program is a poor implementation - C style - and does not utilize any of the C++ STL features.
+
+
+
diff --git a/d3/d30/hash__search_8cpp__incl.md5 b/d3/d30/hash__search_8cpp__incl.md5
new file mode 100644
index 000000000..440fe2336
--- /dev/null
+++ b/d3/d30/hash__search_8cpp__incl.md5
@@ -0,0 +1 @@
+84ba7a48b925a3797dbfd542e265dcdf
\ No newline at end of file
diff --git a/d3/d30/hash__search_8cpp__incl.svg b/d3/d30/hash__search_8cpp__incl.svg
new file mode 100644
index 000000000..c8c719d4f
--- /dev/null
+++ b/d3/d30/hash__search_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+search/hash_search.cpp
+
+Node1
+
+search/hash_search.cpp
+
+
+
+
+Node2
+
+cstdlib
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d39/check__prime_8cpp__incl.map b/d3/d39/check__prime_8cpp__incl.map
new file mode 100644
index 000000000..7272c86c6
--- /dev/null
+++ b/d3/d39/check__prime_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d3/d39/check__prime_8cpp__incl.md5 b/d3/d39/check__prime_8cpp__incl.md5
new file mode 100644
index 000000000..4e5c78351
--- /dev/null
+++ b/d3/d39/check__prime_8cpp__incl.md5
@@ -0,0 +1 @@
+3ebf938e0095dab542ed5d9c4f834f70
\ No newline at end of file
diff --git a/d3/d39/check__prime_8cpp__incl.svg b/d3/d39/check__prime_8cpp__incl.svg
new file mode 100644
index 000000000..3a15adc6c
--- /dev/null
+++ b/d3/d39/check__prime_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/check_prime.cpp
+
+Node1
+
+math/check_prime.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d56/binomial__dist_8cpp__incl.map b/d3/d56/binomial__dist_8cpp__incl.map
new file mode 100644
index 000000000..52c06dff6
--- /dev/null
+++ b/d3/d56/binomial__dist_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d3/d56/binomial__dist_8cpp__incl.md5 b/d3/d56/binomial__dist_8cpp__incl.md5
new file mode 100644
index 000000000..d787b5480
--- /dev/null
+++ b/d3/d56/binomial__dist_8cpp__incl.md5
@@ -0,0 +1 @@
+1c525cb22e94363fb95bb36d47bd8e47
\ No newline at end of file
diff --git a/d3/d56/binomial__dist_8cpp__incl.svg b/d3/d56/binomial__dist_8cpp__incl.svg
new file mode 100644
index 000000000..ff3e6bc05
--- /dev/null
+++ b/d3/d56/binomial__dist_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+probability/binomial_dist.cpp
+
+Node1
+
+probability/binomial
+_dist.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/d61/vector__important__functions_8cpp.html b/d3/d61/vector__important__functions_8cpp.html
new file mode 100644
index 000000000..35eaba0cb
--- /dev/null
+++ b/d3/d61/vector__important__functions_8cpp.html
@@ -0,0 +1,197 @@
+
+
+
+Algorithms_in_C++: others/vector_important_functions.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A C++ program to demonstrate working of std::sort() , std::reverse()
+More...
+
#include <algorithm>#include <iostream>#include <numeric>#include <vector>
+
+
A C++ program to demonstrate working of std::sort() , std::reverse()
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
13 int arr[] = {10, 20, 5, 23, 42, 15};
+
14 int n =
sizeof (arr) /
sizeof (arr[0]);
+
+
+
+
18 for (
int i = 0; i < n; i++)
std::cout << vect[i] <<
" " ;
+
+
+
+
+
23 std::cout <<
"\nVector after sorting is: " ;
+
24 for (
int i = 0; i < n; i++)
std::cout << vect[i] <<
" " ;
+
+
+
+
+
29 std::cout <<
"\nVector after reversing is: " ;
+
30 for (
int i = 0; i < 6; i++)
std::cout << vect[i] <<
" " ;
+
+
32 std::cout <<
"\nMaximum element of vector is: " ;
+
+
+
35 std::cout <<
"\nMinimum element of vector is: " ;
+
+
+
+
39 std::cout <<
"\nThe summation of vector elements is: " ;
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..545bef5ad
--- /dev/null
+++ b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0373c66c8d6fb7c52e5c3c71a27c1620
\ 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
new file mode 100644
index 000000000..fdfcaa5f0
--- /dev/null
+++ b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::vector::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::end
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::reverse
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::sort
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d3/d66/structlinkedlist__coll__graph.map b/d3/d66/structlinkedlist__coll__graph.map
new file mode 100644
index 000000000..ca8355bd5
--- /dev/null
+++ b/d3/d66/structlinkedlist__coll__graph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d3/d66/structlinkedlist__coll__graph.md5 b/d3/d66/structlinkedlist__coll__graph.md5
new file mode 100644
index 000000000..cda3fa991
--- /dev/null
+++ b/d3/d66/structlinkedlist__coll__graph.md5
@@ -0,0 +1 @@
+7af5d3b60d8aad98dcc5e97001f952b6
\ No newline at end of file
diff --git a/d3/d66/structlinkedlist__coll__graph.svg b/d3/d66/structlinkedlist__coll__graph.svg
new file mode 100644
index 000000000..3c6817d27
--- /dev/null
+++ b/d3/d66/structlinkedlist__coll__graph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+linkedlist
+
+Node1
+
+linkedlist
+
+
+
+
+Node1->Node1
+ next
+
+
+
diff --git a/d3/d7d/brute__force__string__searching_8cpp.html b/d3/d7d/brute__force__string__searching_8cpp.html
new file mode 100644
index 000000000..177b6d20d
--- /dev/null
+++ b/d3/d7d/brute__force__string__searching_8cpp.html
@@ -0,0 +1,206 @@
+
+
+
+Algorithms_in_C++: strings/brute_force_string_searching.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
String pattern search - brute force.
+More...
+
#include <iostream>#include <cstring>#include <vector>
+
+
String pattern search - brute force.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
48 for (
size_t i = 0; i <
test_set .size(); i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Initial value: = {
+
+
{"a" , "aa" , "-1" }, {"a" , "a" , "0" }, {"ba" , "b" , "0" },
+
{"bba" , "bb" , "0" }, {"bbca" , "c" , "2" }, {"ab" , "b" , "1" }}
+
set of test cases
+
+
+
+
+
int brute_force(const std::string &text, const std::string &pattern)
Definition: brute_force_string_searching.cpp:21
const std::vector< std::vector< std::string > > test_set
Definition: brute_force_string_searching.cpp:41
+
diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..4a84335b2
--- /dev/null
+++ b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+28b1843201c870f8026b7db3366b4f79
\ 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
new file mode 100644
index 000000000..e54e3fe2f
--- /dev/null
+++ b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+string_search::brute
+_force
+
+
+
+
+Node1->Node2
+
+
+
+Node5
+
+std::to_string
+
+
+
+
+Node1->Node5
+
+
+
+Node3
+
+std::string::length
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::string::substr
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/d3/da3/classstatistics_1_1stats__computer2-members.html b/d3/da3/classstatistics_1_1stats__computer2-members.html
new file mode 100644
index 000000000..1a34d9098
--- /dev/null
+++ b/d3/da3/classstatistics_1_1stats__computer2-members.html
@@ -0,0 +1,120 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for statistics::stats_computer2< T > , including all inherited members.
+
+
Algorithms_in_C++: CycleCheck Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+nodeStates : uint8_t { not_visited = 0,
+in_stack ,
+visited
+ }
+
+
+
◆
+
+
+
+
+
+
+
+
+ static bool CycleCheck::isCyclicBFS
+ (
+ Graph const & graph )
+
+
+
+
+inline static
+
+
+
+
Check if a graph has cycle or not.
+
This function uses BFS to check if a graph is cyclic or not.
+
Parameters
+
+ graph which needs to be evaluated for the presence of cycle.
+
+
+
Returns true if a cycle is detected, else false.
+
+
+
+
+
+
246 for (
auto const & [parent, children] : graphAjdList) {
+
247 for (
auto const & child : children) {
+
+
+
+
+
+
+
+
+
256 if (!indegree[
node ]) {
+
+
+
+
+
+
262 auto remain =
graph .getVertices();
+
+
264 while (!can_be_solved.
empty ()) {
+
265 auto front = can_be_solved.
front ();
+
+
+
+
+
+
+
272 if (
auto it = graphAjdList.find(front); it != graphAjdList.end()) {
+
273 for (
auto child : it->second) {
+
+
275 if (--indegree[child] == 0) {
+
+
+
+
+
+
+
+
+
+
+
286 return !(remain == 0);
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static bool CycleCheck::isCyclicDFS
+ (
+ Graph const & graph )
+
+
+
+
+inline static
+
+
+
+
Driver function to check if a graph has a cycle.
+
This function uses DFS to check for cycle in the graph.
+
Parameters
+
+ graph which needs to be evaluated for the presence of cycle.
+
+
+
Returns true if a cycle is detected, else false.
+
State of the node.
+
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".
+
Initially, all nodes are in "not_visited" state.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
221 if (state[
node ] == not_visited) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static bool CycleCheck::isCyclicDFSHelper
+ (
+ AdjList const & adjList ,
+
+ std::vector < nodeStates > * state ,
+
+ unsigned int
+ node
+
+ )
+
+
+
+
+inline static private
+
+
+
+
Helper function of "isCyclicDFS".
+
Parameters
+
+ adjList is the adjacency list representation of some graph. state is the state of the nodes of the graph. node is the node being evaluated.
+
+
+
Returns true if graph has a cycle, else false.
+
+
+
169 (*state)[
node ] = in_stack;
+
+
+
+
173 if (
auto const & it = adjList.find(
node ); it != adjList.end()) {
+
174 for (
auto child : it->second) {
+
+
+
177 if (
auto state_of_child = (*state)[child];
+
178 state_of_child == not_visited) {
+
+
+
+
182 }
else if (state_of_child == in_stack) {
+
+
+
+
+
+
+
+
+
+
+
193 (*state)[
node ] = visited;
+
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
+graph/cycle_check_directed_graph.cpp
+
+
+
Definition: avltree.cpp:13
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:165
+
diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5
new file mode 100644
index 000000000..d1391cb3c
--- /dev/null
+++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5
@@ -0,0 +1 @@
+5c7e163c03f4879f132c8debafc6f730
\ 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
new file mode 100644
index 000000000..43e4fcc68
--- /dev/null
+++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+CycleCheck::isCyclicDFSHelper
+
+Node1
+
+CycleCheck::isCyclicDFSHelper
+
+
+
+
+Node2
+
+std::unordered_map::end
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::unordered_map
+::find
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map
new file mode 100644
index 000000000..5924aea05
--- /dev/null
+++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5
new file mode 100644
index 000000000..29bae5fdd
--- /dev/null
+++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5
@@ -0,0 +1 @@
+e06ebf0c8f4bd11ec03b5a55588c1ae2
\ 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
new file mode 100644
index 000000000..00436acf8
--- /dev/null
+++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+CycleCheck::isCyclicBFS
+
+Node1
+
+CycleCheck::isCyclicBFS
+
+
+
+
+Node2
+
+std::queue::emplace
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::queue::empty
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::queue::front
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::queue::pop
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map
new file mode 100644
index 000000000..3bf0d39c7
--- /dev/null
+++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5
new file mode 100644
index 000000000..34d9e747c
--- /dev/null
+++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5
@@ -0,0 +1 @@
+c0ea8464055e7e62352b54ce9171307c
\ 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
new file mode 100644
index 000000000..6666bdad5
--- /dev/null
+++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+CycleCheck::isCyclicDFS
+
+Node1
+
+CycleCheck::isCyclicDFS
+
+
+
+
+Node2
+
+CycleCheck::isCyclicDFSHelper
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::unordered_map::end
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::unordered_map
+::find
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.html b/d3/dce/linkedlist__implentation__usingarray_8cpp.html
new file mode 100644
index 000000000..74d1d8a5d
--- /dev/null
+++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.html
@@ -0,0 +1,307 @@
+
+
+
+Algorithms_in_C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Linked list implementation using Arrays.
+More...
+
#include <iostream>
+Node AvailArray [100] array that will act as nodes of a linked list. head = -1 avail = 0
+
+
Linked list implementation using Arrays.
+
The difference between the pointer implementation of linked list and array implementation of linked list:
+The NULL is represented by -1;
+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.
+
+
+
+
◆
+
+
+
+
+
+ void freeNode
+ (
+ int
+ nodeToBeDeleted )
+
+
+
+
This function when called will delete the node with the index presented as an argument, and will put back that node into the array.
+
+
+
44 avail = nodeToBeDeleted;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int getnode
+ (
+ )
+
+
+
+
This will return the index of the first free node present in the avail list
+
+
33 int NodeIndexToBeReturned = avail;
+
+
35 return NodeIndexToBeReturned;
+
+
+
+
+
+
◆
+
+
+
+
+
+ void insertAtTheBeginning
+ (
+ int
+ data )
+
+
+
+
The function will insert the given data into the front of the linked list.
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
102 <<
"The linked list contains the following element in order"
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
int getnode()
Definition: linkedlist_implentation_usingarray.cpp:32
int data[MAX]
test data
Definition: hash_search.cpp:24
Node AvailArray[100]
array that will act as nodes of a linked list.
Definition: linkedlist_implentation_usingarray.cpp:19
+
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5
new file mode 100644
index 000000000..68309c225
--- /dev/null
+++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5
@@ -0,0 +1 @@
+9d89a809b7ab90fffbfd49f934f960a2
\ 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
new file mode 100644
index 000000000..0b3d9a345
--- /dev/null
+++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+insertAtTheBeginning
+
+Node1
+
+insertAtTheBeginning
+
+
+
+
+Node2
+
+getnode
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/d0c/binary__search__tree_8cpp__incl.map b/d4/d0c/binary__search__tree_8cpp__incl.map
new file mode 100644
index 000000000..44a8dc29d
--- /dev/null
+++ b/d4/d0c/binary__search__tree_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d4/d0c/binary__search__tree_8cpp__incl.md5 b/d4/d0c/binary__search__tree_8cpp__incl.md5
new file mode 100644
index 000000000..26d17aad5
--- /dev/null
+++ b/d4/d0c/binary__search__tree_8cpp__incl.md5
@@ -0,0 +1 @@
+c6eb225f7bee89c7f15da1aff139cc80
\ No newline at end of file
diff --git a/d4/d0c/binary__search__tree_8cpp__incl.svg b/d4/d0c/binary__search__tree_8cpp__incl.svg
new file mode 100644
index 000000000..bec2e90c4
--- /dev/null
+++ b/d4/d0c/binary__search__tree_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+data_structures/binary_search_tree.cpp
+
+Node1
+
+data_structures/binary
+_search_tree.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/d0e/class_bit-members.html b/d4/d0e/class_bit-members.html
new file mode 100644
index 000000000..1e0a5e196
--- /dev/null
+++ b/d4/d0e/class_bit-members.html
@@ -0,0 +1,119 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Bit , including all inherited members.
+
+ bit (defined in Bit )Bit private Bit (vector< int > &arr) (defined in Bit )Bit inline Bit (int x) (defined in Bit )Bit inline n (defined in Bit )Bit private offset (int x) (defined in Bit )Bit inline private sum (int id) (defined in Bit )Bit inline sum_range (int l, int r) (defined in Bit )Bit inline update (int id, int val) (defined in Bit )Bit inline
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for MinHeap , including all inherited members.
+
+
Algorithms_in_C++: math/least_common_multiple.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <cassert>#include <iostream>
+unsigned int gcd (unsigned int x, unsigned int y) unsigned int lcm (unsigned int x, unsigned int y) void tests () int main ()
+
+
Copyright 2020
Author tjgurwara99
+
A basic implementation of LCM function
+
+
+
◆
+
+
+
+
+
+ unsigned int gcd
+ (
+ unsigned int
+ x ,
+
+ unsigned int
+ y
+
+ )
+
+
+
+
Function for finding greatest common divisor of two numbers. @params two integers x and y whose gcd we want to find.
Returns greatest common divisor of x and y.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
30 return gcd (y, x - temp * y);
+
+
+
+
+
35 return gcd (x, y - temp * x);
+
+
+
+
+
+
◆
+
+
+
+
+
+ unsigned int lcm
+ (
+ unsigned int
+ x ,
+
+ unsigned int
+ y
+
+ )
+
+
+
+
Function for finding the least common multiple of two numbers. @params integer x and y whose lcm we want to find.
Returns lcm of x and y using the relation x * y = gcd(x, y) * lcm(x, y)
+
43 {
return x * y /
gcd (x, y); }
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
◆
+
+
+
+
+
+ void tests
+ (
+ )
+
+
+
+
Function for testing the lcm() functions with some assert statements.
+
+
+
50 assert(((
void )
"LCM of 5 and 10 is 10 but lcm function gives a different "
+
+
+
53 std::cout <<
"First assertion passes: LCM of 5 and 10 is " <<
lcm (5, 10)
+
+
+
+
57 assert(((
void )
"LCM of 2 and 3 is 6 but lcm function gives a different "
+
+
+
60 std::cout <<
"Second assertion passes: LCM of 2 and 3 is " <<
lcm (2, 3)
+
+
+
+
+
+
+
+
+
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
void tests()
Definition: least_common_multiple.cpp:48
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
+
diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
new file mode 100644
index 000000000..1b080a565
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
@@ -0,0 +1 @@
+848b9a4f6fc8bb8f5d8cd8d8bf8e39f8
\ 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
new file mode 100644
index 000000000..44e25509c
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+tests
+
+Node1
+
+tests
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+lcm
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+gcd
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map
new file mode 100644
index 000000000..c2f98f48b
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5
new file mode 100644
index 000000000..7f0270c34
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5
@@ -0,0 +1 @@
+31d2c67966697e5578929cea1691d489
\ 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
new file mode 100644
index 000000000..6ae30c6ec
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+lcm
+
+Node1
+
+lcm
+
+
+
+
+Node2
+
+gcd
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..d703d3a22
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..02c515cb2
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+1c1c5b7f4e25e868e53fb5f1523b1996
\ 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
new file mode 100644
index 000000000..8fe855971
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tests
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+lcm
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+gcd
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.map b/d4/d26/durand__kerner__roots_8cpp__incl.map
new file mode 100644
index 000000000..3a96d8b74
--- /dev/null
+++ b/d4/d26/durand__kerner__roots_8cpp__incl.map
@@ -0,0 +1,12 @@
+
+
diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.md5 b/d4/d26/durand__kerner__roots_8cpp__incl.md5
new file mode 100644
index 000000000..24ed705c3
--- /dev/null
+++ b/d4/d26/durand__kerner__roots_8cpp__incl.md5
@@ -0,0 +1 @@
+1aaa7a5f0108eb8289fa4e59bdbeafc7
\ No newline at end of file
diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.svg b/d4/d26/durand__kerner__roots_8cpp__incl.svg
new file mode 100644
index 000000000..05bdd8f6a
--- /dev/null
+++ b/d4/d26/durand__kerner__roots_8cpp__incl.svg
@@ -0,0 +1,246 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+numerical_methods/durand_kerner_roots.cpp
+
+Node1
+
+numerical_methods/durand
+_kerner_roots.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cassert
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cmath
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+complex
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+cstdlib
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+ctime
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+fstream
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+iostream
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+valarray
+
+
+
+
+Node1->Node10
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg
new file mode 100644
index 000000000..d52ae368a
--- /dev/null
+++ b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg
@@ -0,0 +1,158 @@
+
+
+
+
+
+
+numerical_methods/durand_kerner_roots.cpp
+
+Node1
+
+numerical_methods/durand
+_kerner_roots.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cassert
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cmath
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+complex
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+cstdlib
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+ctime
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+fstream
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+iostream
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+valarray
+
+
+
+
+Node1->Node10
+
+
+
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
new file mode 100644
index 000000000..3d67b1faf
--- /dev/null
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map
@@ -0,0 +1,4 @@
+
+
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
new file mode 100644
index 000000000..9159d4278
--- /dev/null
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5
@@ -0,0 +1 @@
+e3fce234b2c4d98f287b341746a4fea3
\ 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
new file mode 100644
index 000000000..148955741
--- /dev/null
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg
@@ -0,0 +1,46 @@
+
+
+
+
+
+
+Trie::TrieNode
+
+Node1
+
+Trie::TrieNode
+
+
+
+
+Node2
+
+std::shared_ptr< Trie
+::TrieNode >
+
+
+
+
+Node1->Node2
+ ptr
+
+
+
+Node2->Node1
+ character
+
+
+
diff --git a/d4/d32/fibonacci__fast_8cpp.html b/d4/d32/fibonacci__fast_8cpp.html
new file mode 100644
index 000000000..fc260821e
--- /dev/null
+++ b/d4/d32/fibonacci__fast_8cpp.html
@@ -0,0 +1,246 @@
+
+
+
+Algorithms_in_C++: math/fibonacci_fast.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Faster computation of Fibonacci series.
+More...
+
#include <cinttypes>#include <cstdio>#include <iostream>
+uint64_t fib (uint64_t n) int main ()
+const uint64_t MAX = 93 uint64_t f [MAX ] = {0}
+
+
Faster computation of Fibonacci series.
+
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.
+
Author Krishna Vedala
+
See also fibonacci_large.cpp , fibonacci.cpp , string_fibonacci.cpp
+
+
+
◆
+
+
+
+
+
+ uint64_t fib
+ (
+ uint64_t
+ n )
+
+
+
+
Algorithm
+
+
+
+
+
+
+
+
+
+
39 uint64_t
k = (n % 2 != 0) ? (n + 1) / 2 : n / 2;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
49 for (uint64_t i = 1; i < 93; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ uint64_t f[MAX ] = {0}
+
+
+
+
Array of computed fibonacci numbers
+
+
+
+
+
◆
+
+
+
+
+
+ const uint64_t MAX = 93
+
+
+
+
maximum number that can be computed - The result after 93 cannot be stored in a uint64_t data type.
+
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
ll k
Definition: matrix_exponentiation.cpp:48
uint64_t fib(uint64_t n)
Definition: fibonacci_fast.cpp:30
+
diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..7e24798c6
--- /dev/null
+++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+fb38e9866373b8345412cc1b5490f304
\ 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
new file mode 100644
index 000000000..5132d3351
--- /dev/null
+++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+fib
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.html b/d4/d45/gcd__recursive__euclidean_8cpp.html
new file mode 100644
index 000000000..77ea6f3ac
--- /dev/null
+++ b/d4/d45/gcd__recursive__euclidean_8cpp.html
@@ -0,0 +1,225 @@
+
+
+
+Algorithms_in_C++: math/gcd_recursive_euclidean.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm
+More...
+
#include <iostream>
+int gcd (int num1, int num2) int main ()
+
+
Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm
+
See also gcd_iterative_euclidean.cpp , gcd_of_n_numbers.cpp
+
+
+
◆
+
+
+
+
+
+ int gcd
+ (
+ int
+ num1 ,
+
+ int
+ num2
+
+ )
+
+
+
+
algorithm
+
+
15 if (num1 <= 0 | num2 <= 0) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
35 return gcd (num1 - num2, num2);
+
36 return gcd (num1, num2 - num1);
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
int gcd(int num1, int num2)
Definition: gcd_recursive_euclidean.cpp:14
+
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..5328ec2a1
--- /dev/null
+++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+b86b27d1965842cad0032b0a94ca524d
\ 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
new file mode 100644
index 000000000..2133f5e93
--- /dev/null
+++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+gcd
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/d59/large__factorial_8cpp__incl.map b/d4/d59/large__factorial_8cpp__incl.map
new file mode 100644
index 000000000..8305daeee
--- /dev/null
+++ b/d4/d59/large__factorial_8cpp__incl.map
@@ -0,0 +1,12 @@
+
+
diff --git a/d4/d59/large__factorial_8cpp__incl.md5 b/d4/d59/large__factorial_8cpp__incl.md5
new file mode 100644
index 000000000..5c5c35cda
--- /dev/null
+++ b/d4/d59/large__factorial_8cpp__incl.md5
@@ -0,0 +1 @@
+8fb77ccff37a413f4f4832efcd1f7cbe
\ No newline at end of file
diff --git a/d4/d59/large__factorial_8cpp__incl.svg b/d4/d59/large__factorial_8cpp__incl.svg
new file mode 100644
index 000000000..da81bf9f1
--- /dev/null
+++ b/d4/d59/large__factorial_8cpp__incl.svg
@@ -0,0 +1,169 @@
+
+
+
+
+
+
+math/large_factorial.cpp
+
+Node1
+
+math/large_factorial.cpp
+
+
+
+
+Node2
+
+cstring
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+./large_number.h
+
+
+
+
+Node1->Node5
+
+
+
+Node5->Node2
+
+
+
+Node5->Node4
+
+
+
+Node6
+
+algorithm
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+cassert
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+cinttypes
+
+
+
+
+Node5->Node8
+
+
+
+Node9
+
+type_traits
+
+
+
+
+Node5->Node9
+
+
+
+Node10
+
+vector
+
+
+
+
+Node5->Node10
+
+
+
diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.map b/d4/d60/kohonen__som__trace_8cpp__incl.map
new file mode 100644
index 000000000..8c5c42875
--- /dev/null
+++ b/d4/d60/kohonen__som__trace_8cpp__incl.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.md5 b/d4/d60/kohonen__som__trace_8cpp__incl.md5
new file mode 100644
index 000000000..22bd2e644
--- /dev/null
+++ b/d4/d60/kohonen__som__trace_8cpp__incl.md5
@@ -0,0 +1 @@
+b35af84eeb4930be52757e882a8fae69
\ No newline at end of file
diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.svg b/d4/d60/kohonen__som__trace_8cpp__incl.svg
new file mode 100644
index 000000000..fd535f686
--- /dev/null
+++ b/d4/d60/kohonen__som__trace_8cpp__incl.svg
@@ -0,0 +1,231 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning/kohonen_som_trace.cpp
+
+Node1
+
+machine_learning/kohonen
+_som_trace.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+fstream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+valarray
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg
new file mode 100644
index 000000000..4f2c0fa3a
--- /dev/null
+++ b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+machine_learning/kohonen_som_trace.cpp
+
+Node1
+
+machine_learning/kohonen
+_som_trace.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+fstream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+valarray
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html
new file mode 100644
index 000000000..9a1e6267e
--- /dev/null
+++ b/d4/d68/qr__decompose_8h.html
@@ -0,0 +1,167 @@
+
+
+
+Algorithms_in_C++: numerical_methods/qr_decompose.h File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Library functions to compute QR decomposition of a given matrix.
+More...
+
#include <cmath>#include <cstdlib>#include <iomanip>#include <iostream>#include <limits>#include <numeric>#include <valarray>
+
Go to the source code of this file.
+
+
+
Library functions to compute QR decomposition of a given matrix.
+
Author Krishna Vedala
+
+
Algorithms_in_C++: numerical_methods/qr_decompose.h Source File
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Go to the documentation of this file.
+
+
+
+
+
+
+
+
9 #ifndef NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
10 #define NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
36 const char separator =
' ' ;
+
+
+
39 for (
size_t row = 0; row < v.size(); row++) {
+
40 for (
size_t col = 0; col < v[row].size(); col++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
55 const char separator =
' ' ;
+
+
+
58 for (
size_t row = 0; row < v.size(); row++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
103 template <
typename T>
+
+
+
+
+
+
+
+
111 std::cerr <<
"[" << __func__ <<
"] Possible division by zero\n" ;
+
+
+
+
115 double scalar = num / deno;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
145 template <
typename T>
+
+
+
+
+
+
+
+
+
+
+
+
157 for (
int i = 0; i < COLUMNS; i++) {
+
+
+
+
+
+
+
+
+
+
167 for (j = 0; j < ROWS; j++) {
+
168 tmp_vector[j] = A[j][i];
+
169 col_vector[j] = A[j][i];
+
+
171 for (j = 0; j < i; j++) {
+
172 for (
int k = 0;
k < ROWS;
k ++) {
+
173 col_vector2[
k ] = Q[0][
k ][j];
+
+
175 col_vector2 =
vector_proj (col_vector, col_vector2);
+
176 tmp_vector -= col_vector2;
+
+
+
+
+
+
+
+
+
185 for (j = 0; j < ROWS; j++) Q[0][j][i] = tmp_vector[j] / mag;
+
+
+
+
+
+
+
192 for (
int kk = 0; kk < ROWS; kk++) {
+
193 col_vector[kk] = Q[0][kk][i];
+
+
+
+
+
+
+
200 for (
int k = i;
k < COLUMNS;
k ++) {
+
201 for (
int kk = 0; kk < ROWS; kk++) {
+
202 col_vector2[kk] = A[kk][
k ];
+
+
204 R[0][i][
k ] = (col_vector * col_vector2).sum();
+
+
+
+
+
+
210 #endif // NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
+
bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_midpoint_euler.cpp:156
double Sqrt(double a)
Definition: sqrt_double.cpp:16
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
void tests()
Definition: least_common_multiple.cpp:48
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
int main()
Definition: primes_up_to_billion.cpp:26
double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the semi-implicit-Euler method in the given limits.
Definition: ode_semi_implicit_euler.cpp:103
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: lu_decompose.cpp:75
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
friend std::istream & operator>>(std::istream &input, stats_computer2 &stat)
Definition: realtime_stats.cpp:97
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: newton_raphson_method.cpp:22
void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the semi-implicit-Euler method.
Definition: ode_semi_implicit_euler.cpp:82
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:195
static double eq(double i)
Definition: newton_raphson_method.cpp:26
static double eq_der(double i)
Definition: newton_raphson_method.cpp:32
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_forward_euler.cpp:67
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
int main(int argc, char *argv[])
Definition: ode_forward_euler.cpp:188
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
int main()
Definition: sieve_of_eratosthenes.cpp:59
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
int sgn(T val)
Definition: bisection_method.cpp:32
double std() const
Definition: realtime_stats.cpp:48
void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the midpoint-Euler method.
Definition: ode_midpoint_euler.cpp:85
std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:54
int main()
Definition: prime_factorization.cpp:62
void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
Functions to compute QR decomposition of any rectangular matrix.
std::vector< std::vector< T > > operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)
Definition: ordinary_least_squares_regressor.cpp:71
int main()
Definition: prime_numbers.cpp:26
void forward_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the forward-Euler method.
Definition: ode_forward_euler.cpp:86
int main()
Definition: modular_inverse_fermat_little_theorem.cpp:84
std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: ordinary_least_squares_regressor.cpp:19
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_forward_euler.cpp:152
void init()
Definition: sieve_of_eratosthenes.cpp:52
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
int main()
Definition: false_position.cpp:39
double vector_mag(const std::valarray< T > &a)
Definition: qr_decompose.h:92
ll k
Definition: matrix_exponentiation.cpp:48
double variance() const
Definition: realtime_stats.cpp:89
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
int main()
Definition: sqrt_double.cpp:42
void sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:25
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
int main(int argc, char **argv)
Definition: lu_decompose.cpp:91
int main()
Definition: ordinary_least_squares_regressor.cpp:357
void test1()
Definition: durand_kerner_roots.cpp:207
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
Definition: ordinary_least_squares_regressor.cpp:339
int main()
Definition: gaussian_elimination.cpp:9
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
double mean() const
Definition: realtime_stats.cpp:42
Definition: realtime_stats.cpp:72
std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)
Definition: qr_decompose.h:33
double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the forward-Euler method in the given limits.
Definition: ode_forward_euler.cpp:102
int main(int argc, char **argv)
Definition: realtime_stats.cpp:158
int sgn(T val)
Definition: false_position.cpp:34
vector< ll > a
Definition: matrix_exponentiation.cpp:53
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_semi_implicit_euler.cpp:53
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
int main()
Definition: least_common_multiple.cpp:67
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_forward_euler.cpp:54
int data[MAX]
test data
Definition: hash_search.cpp:24
#define MAX
Definition: sieve_of_eratosthenes.cpp:16
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
Definition: ordinary_least_squares_regressor.cpp:309
std::vector< T > operator-(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:174
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:217
void new_val(T x)
Definition: realtime_stats.cpp:32
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:76
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_midpoint_euler.cpp:53
void new_val(T x)
Definition: realtime_stats.cpp:77
double variance() const
Definition: realtime_stats.cpp:45
int main()
Definition: newton_raphson_method.cpp:37
double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the midpoint-Euler method in the given limits.
Definition: ode_midpoint_euler.cpp:107
int main()
Definition: number_of_positive_divisors.cpp:62
int main()
Definition: power_for_huge_numbers.cpp:82
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
Definition: realtime_stats.cpp:27
double std() const
Definition: realtime_stats.cpp:92
bool isprime[MAX]
Definition: sieve_of_eratosthenes.cpp:19
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
int main(int argc, char *argv[])
Definition: ode_semi_implicit_euler.cpp:189
static double eq(double i)
Definition: false_position.cpp:28
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_semi_implicit_euler.cpp:153
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_semi_implicit_euler.cpp:66
int main()
Definition: string_fibonacci.cpp:81
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
static double eq(double i)
Definition: bisection_method.cpp:26
void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
double mean() const
Definition: realtime_stats.cpp:86
bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
void test2()
Definition: durand_kerner_roots.cpp:242
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_midpoint_euler.cpp:66
int lu_decomposition(const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
Definition: lu_decompose.cpp:22
int main()
Definition: bisection_method.cpp:37
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:165
#define MAX
Definition: power_for_huge_numbers.cpp:10
friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
int main(int argc, char *argv[])
Definition: ode_midpoint_euler.cpp:192
char prime[100000000]
Definition: primes_up_to_billion.cpp:10
bool isprime[1000006]
Definition: prime_factorization.cpp:13
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:288
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Entry , including all inherited members.
+
+ Entry (int key=notPresent) (defined in Entry )Entry inline explicit Entry (int key=notPresent) (defined in Entry )Entry inline explicit Entry (int key=notPresent) (defined in Entry )Entry inline explicit key (defined in Entry )Entry
+
+
diff --git a/d4/d72/qr__eigen__values_8cpp__incl.md5 b/d4/d72/qr__eigen__values_8cpp__incl.md5
new file mode 100644
index 000000000..c9b815bd3
--- /dev/null
+++ b/d4/d72/qr__eigen__values_8cpp__incl.md5
@@ -0,0 +1 @@
+59ca5d316530e83f6ca2574df93cfafc
\ No newline at end of file
diff --git a/d4/d72/qr__eigen__values_8cpp__incl.svg b/d4/d72/qr__eigen__values_8cpp__incl.svg
new file mode 100644
index 000000000..b55e917a3
--- /dev/null
+++ b/d4/d72/qr__eigen__values_8cpp__incl.svg
@@ -0,0 +1,191 @@
+
+
+
+
+
+
+numerical_methods/qr_eigen_values.cpp
+
+Node1
+
+numerical_methods/qr
+_eigen_values.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+iostream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+./qr_decompose.h
+
+
+
+
+Node1->Node7
+
+
+
+Node7->Node3
+
+
+
+Node7->Node4
+
+
+
+Node7->Node6
+
+
+
+Node8
+
+iomanip
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+limits
+
+
+
+
+Node7->Node9
+
+
+
+Node10
+
+numeric
+
+
+
+
+Node7->Node10
+
+
+
+Node11
+
+valarray
+
+
+
+
+Node7->Node11
+
+
+
diff --git a/d4/d7a/shell__sort2_8cpp.html b/d4/d7a/shell__sort2_8cpp.html
new file mode 100644
index 000000000..b3ae24fcd
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp.html
@@ -0,0 +1,522 @@
+
+
+
+Algorithms_in_C++: sorting/shell_sort2.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Shell sort algorithm
+More...
+
#include <cassert>#include <cstdlib>#include <ctime>#include <iostream>#include <utility>#include <vector>
+ sorting Sorting algorithms.
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ int compare
+ (
+ const void *
+ a ,
+
+ const void *
+ b
+
+ )
+
+
+
+
function to compare sorting using cstdlib's qsort
+
+
88 T arg1 = *
static_cast< const T *
> (
a );
+
89 T arg2 = *
static_cast< const T *
> (b);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
Main function
+
+
+
+
+
+
188 std::cout <<
"Test 1 - 100 int values - passed. \n" ;
+
+
190 std::cout <<
"Test 2 - 1000 int values - passed.\n" ;
+
+
192 std::cout <<
"Test 3 - 10000 int values - passed.\n" ;
+
+
+
195 std::cout <<
"Test 1 - 100 float values - passed. \n" ;
+
+
197 std::cout <<
"Test 2 - 1000 float values - passed.\n" ;
+
+
199 std::cout <<
"Test 3 - 10000 float values - passed.\n" ;
+
+
+
+
+
204 NUM_DATA =
atoi (argv[1]);
+
+
+
+
+
209 int *
data =
new int [NUM_DATA];
+
+
+
+
+
214 for (i = 0; i < NUM_DATA; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
226 <<
"Data Sorted using custom implementation: " <<
std::endl ;
+
+
+
229 double elapsed_time = (
end - start) * 1.
f / CLOCKS_PER_SEC;
+
+
+
+
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
+template<class T >
+
+
+ void show_data
+ (
+ T *
+ arr ,
+
+ size_t
+ LEN
+
+ )
+
+
+
+
pretty print array
Parameters
+
+ [in] arr array to print [in] LEN length of array to print
+
+
+
+
+
+
21 for (i = 0; i < LEN; i++) {
+
+
+
+
+
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
+template<typename T , size_t N>
+
+
+ void show_data
+ (
+ T(&)
+ arr [N])
+
+
+
+
pretty print array
Parameters
+
+ [in] arr array to print [in] N length of array to print
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test_f
+ (
+ const int
+ NUM_DATA )
+
+
+
+
Test implementation of shell_sort on float arrays by comparing results against std::qsort .
+
+
+
147 float *
data =
new float [NUM_DATA];
+
148 float *data2 =
new float [NUM_DATA];
+
+
+
+
152 for (
int i = 0; i < NUM_DATA; i++) {
+
153 data [i] = data2[i] = ((
std::rand () % range) - (range >> 1)) / 100.;
+
+
+
+
+
+
+
160 double elapsed_time =
static_cast< double > (
end - start) / CLOCKS_PER_SEC;
+
161 std::cout <<
"Time spent sorting using shell_sort2: " << elapsed_time
+
+
+
+
+
+
+
+
169 elapsed_time =
static_cast< double > (
end - start) / CLOCKS_PER_SEC;
+
170 std::cout <<
"Time spent sorting using std::qsort: " << elapsed_time
+
+
+
173 for (
int i = 0; i < NUM_DATA; i++) {
+
174 assert(
data [i] == data2[i]);
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test_int
+ (
+ const int
+ NUM_DATA )
+
+
+
+
Test implementation of shell_sort on integer arrays by comparing results against std::qsort .
+
+
+
107 int *
data =
new int [NUM_DATA];
+
108 int *data2 =
new int [NUM_DATA];
+
+
+
+
112 for (
int i = 0; i < NUM_DATA; i++)
+
+
+
+
+
+
+
119 double elapsed_time =
static_cast< double > (
end - start) / CLOCKS_PER_SEC;
+
120 std::cout <<
"Time spent sorting using shell_sort2: " << elapsed_time
+
+
+
+
+
+
+
+
128 elapsed_time =
static_cast< double > (
end - start) / CLOCKS_PER_SEC;
+
129 std::cout <<
"Time spent sorting using std::qsort: " << elapsed_time
+
+
+
132 for (
int i = 0; i < NUM_DATA; i++) {
+
133 assert(
data [i] == data2[i]);
+
+
+
+
+
+
+
+
+
+
+
+
+
void test_f(const int NUM_DATA)
Definition: shell_sort2.cpp:145
void show_data(T *arr, size_t LEN)
Definition: shell_sort2.cpp:18
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
void test_int(const int NUM_DATA)
Definition: shell_sort2.cpp:105
vector< ll > a
Definition: matrix_exponentiation.cpp:53
int data[MAX]
test data
Definition: hash_search.cpp:24
Definition: huffman.cpp:28
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..a16fa6a7f
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+812d230fd2b0faf5643b5581462b3ba1
\ 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
new file mode 100644
index 000000000..d4841201e
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,235 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::rand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+sorting::shell_sort
+
+
+
+
+Node1->Node5
+
+
+
+Node7
+
+show_data
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::srand
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+test_f
+
+
+
+
+Node1->Node9
+
+
+
+Node11
+
+test_int
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+std::time
+
+
+
+
+Node1->Node12
+
+
+
+Node6
+
+sorting::shell_sort
+
+
+
+
+Node5->Node6
+
+
+
+Node7->Node3
+
+
+
+Node9->Node2
+
+
+
+Node9->Node4
+
+
+
+Node9->Node5
+
+
+
+Node10
+
+std::qsort
+
+
+
+
+Node9->Node10
+
+
+
+Node11->Node2
+
+
+
+Node11->Node4
+
+
+
+Node11->Node5
+
+
+
+Node11->Node10
+
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map
new file mode 100644
index 000000000..070e7b260
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5
new file mode 100644
index 000000000..64a1bd58d
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5
@@ -0,0 +1 @@
+8c97e2ca8e8ba98d949db5d5fdd1b107
\ 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
new file mode 100644
index 000000000..03a217d04
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+test_f
+
+Node1
+
+test_f
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::qsort
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::rand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+sorting::shell_sort
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+sorting::shell_sort
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map
new file mode 100644
index 000000000..3c8b874e8
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5
new file mode 100644
index 000000000..ea991d5a1
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5
@@ -0,0 +1 @@
+970a233cb66fe44417f3f67bd58ef33a
\ 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
new file mode 100644
index 000000000..41922d6ad
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+show_data
+
+Node1
+
+show_data
+
+
+
+
+Node2
+
+show_data
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map
new file mode 100644
index 000000000..f8b073597
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5
new file mode 100644
index 000000000..eda02a944
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5
@@ -0,0 +1 @@
+6fdbd3961686ad9c94cf92f09ce49f18
\ 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
new file mode 100644
index 000000000..91dafec98
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+test_int
+
+Node1
+
+test_int
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::qsort
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::rand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+sorting::shell_sort
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+sorting::shell_sort
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map
new file mode 100644
index 000000000..a809b4d64
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5
new file mode 100644
index 000000000..02c7b3403
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5
@@ -0,0 +1 @@
+b7bc3450f2a6c3644f098184a9ef4054
\ 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
new file mode 100644
index 000000000..5dc5d5b34
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+show_data
+
+Node1
+
+show_data
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/d86/large__number_8h.html b/d4/d86/large__number_8h.html
new file mode 100644
index 000000000..fb0d39a8c
--- /dev/null
+++ b/d4/d86/large__number_8h.html
@@ -0,0 +1,144 @@
+
+
+
+Algorithms_in_C++: math/large_number.h File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Library to perform arithmatic operations on arbitrarily large numbers.
+More...
+
#include <algorithm>#include <cassert>#include <cinttypes>#include <cstring>#include <iostream>#include <type_traits>#include <vector>
+
Go to the source code of this file.
+
+
+
Library to perform arithmatic operations on arbitrarily large numbers.
+
Author Krishna Vedala
+
+
Algorithms_in_C++: math/large_number.h Source File
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Go to the documentation of this file.
+
+
+
+
+
+
+
8 #ifndef MATH_LARGE_NUMBER_H_
+
9 #define MATH_LARGE_NUMBER_H_
+
+
+
+
+
+
15 #include <type_traits>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
55 for (
size_t i = strlen(number_str); i > 0; i--) {
+
56 unsigned char a = number_str[i - 1] -
'0' ;
+
+
+
+
+
+
+
+
+
+
66 std::cout <<
"------ Checking `large_number` class implementations\t"
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
108 <<
"!=7000000000000000000000000005202)" <<
std::endl ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
139 inline const unsigned char &
operator[] (
size_t n)
const {
+
+
+
+
+
+
+
+
147 for (
size_t i =
a .num_digits(); i > 0; i--)
+
148 out << static_cast<int>(
a [i - 1]);
+
+
+
+
+
+
+
+
156 size_t N =
a .num_digits();
+
157 if (N != b.num_digits())
+
+
159 for (
size_t i = 0; i < N; i++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
196 unsigned int carry = 0;
+
+
198 for (i = 0; i < max_L || carry != 0; i++) {
+
+
+
+
+
+
204 (*this)[i] = carry % 10;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
240 "Must be integer addition unsigned integer types." );
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
260 "Can only have integer types." );
+
+
+
+
+
265 uint64_t carry = 0, temp;
+
+
267 temp = (*this)[i] * n;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
288 #endif // MATH_LARGE_NUMBER_H_
+
+
int binExpo(int a, int b)
Definition: binary_exponent.cpp:28
void add_digit(unsigned int value)
Definition: large_number.h:118
void pop()
Definition: stack.h:60
Definition: trie_tree.cpp:8
int main()
main function
Definition: double_factorial.cpp:36
int main()
Definition: gcd_of_n_numbers.cpp:28
T setprecision(T... args)
static bool isCyclicBFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:241
void addVertices(unsigned int num=1)
Definition: cycle_check_directed_graph.cpp:122
bool test1()
Definition: large_factorial.cpp:17
T inner_product(T... args)
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
int gcd(int num1, int num2)
Definition: gcd_iterative_euclidean.cpp:15
int main()
Main function.
Definition: fibonacci.cpp:28
friend std::ostream & operator<<(std::ostream &out, const large_number &a)
Definition: large_number.h:146
large_number(std::vector< unsigned char > &vec)
Definition: large_number.h:51
void deQueue()
Definition: queue.h:67
void update_step(T *r, T *r0, const T2 quotient)
Definition: extended_euclid_algorithm.cpp:24
uint64_t double_factorial_iterative(uint64_t n)
Definition: double_factorial.cpp:16
adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)
Definition: adaline_learning.cpp:51
Definition: trie_modern.cpp:16
void test1()
Definition: kohonen_som_topology.cpp:357
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:110
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
Definition: large_number.h:24
large_number fib(uint64_t n)
Definition: fibonacci_large.cpp:24
int main()
Definition: fibonacci_fast.cpp:47
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
int main(int argc, char **argv)
Definition: kohonen_som_topology.cpp:564
static bool hasChildren(std::shared_ptr< TrieNode > node)
Definition: trie_modern.cpp:41
int main(int argc, char *argv[])
Definition: large_factorial.cpp:89
void test_3d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:347
Definition: trie_modern.cpp:26
int gcd(int num1, int num2)
Definition: gcd_recursive_euclidean.cpp:14
Library to perform arithmatic operations on arbitrarily large numbers.
Definition: avltree.cpp:13
int binExpo_alt(int a, int b)
Definition: binary_exponent.cpp:42
int save_nd_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_trace.cpp:57
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_trace.cpp:438
Graph(unsigned int vertices, std::vector< Edge > const &edges)
Definition: cycle_check_directed_graph.cpp:90
const char digit_char(size_t i) const
Definition: large_number.h:248
int predict(const std::vector< double > &x, double *out=nullptr)
Definition: adaline_learning.cpp:90
Machine learning algorithms.
int main()
Definition: gcd_recursive_euclidean.cpp:42
double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
Definition: kohonen_som_topology.cpp:191
Definition: bellman_ford.cpp:13
Definition: bridge_finding_with_tarjan_algorithm.cpp:13
void get_min_2d(const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
Definition: kohonen_som_topology.cpp:97
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:174
Definition: double_hash_hash_table.cpp:28
void test1()
Definition: kohonen_som_trace.cpp:225
large_number & operator+=(large_number n)
Definition: large_number.h:192
const size_t num_digits() const
Definition: large_number.h:130
bool is_prime(T num)
Definition: check_prime.cpp:22
double fast_power_recursive(T a, T b)
Definition: fast_power.cpp:26
Definition: linkedlist_implentation_usingarray.cpp:14
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
int main(int argc, char **argv)
Definition: kohonen_som_trace.cpp:443
large_number(const large_number &a)
Definition: large_number.h:48
int fibonacci(unsigned int n)
Definition: fibonacci.cpp:17
void insert(const std::string &word)
Definition: trie_modern.cpp:109
Definition: binary_search_tree.cpp:17
static bool isCyclicDFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:206
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
void test3()
Definition: kohonen_som_topology.cpp:521
node * createNode(int data)
Definition: avltree.cpp:21
Definition: cycle_check_directed_graph.cpp:153
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:165
large_number & operator*=(const T n)
Definition: large_number.h:238
large_number()
Definition: large_number.h:27
void init()
Definition: sieve_of_eratosthenes.cpp:52
int main()
Main function.
Definition: binary_exponent.cpp:55
Definition: huffman.cpp:7
int main()
Definition: line_segment_intersection.cpp:92
large_number & operator++()
Definition: large_number.h:175
void test1(double eta=0.01)
Definition: adaline_learning.cpp:202
node * insert(node *root, int item)
Definition: avltree.cpp:66
unsigned char & operator[](size_t n)
Definition: large_number.h:137
int h(int key)
Definition: hash_search.cpp:45
int direction(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:63
std::remove_reference_t< AdjList > const & getAdjList() const
Definition: cycle_check_directed_graph.cpp:105
const double eta
learning rate of the algorithm
Definition: adaline_learning.cpp:185
ll k
Definition: matrix_exponentiation.cpp:48
uint64_t phiFunction(uint64_t n)
Definition: eulers_totient_function.cpp:32
Edge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:42
Trie()
constructor to initialise the root of the trie.
Definition: trie_modern.cpp:103
Definition: prims_minimum_spanning_tree.cpp:9
void addEdge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:140
int main()
Definition: factorial.cpp:15
void multiply(const T n)
Definition: large_number.h:258
#define ll
Definition: matrix_exponentiation.cpp:33
std::vector< double > weights
weights of the neural network
Definition: adaline_learning.cpp:187
Definition: line_segment_intersection.cpp:22
large_number & operator=(const large_number &b)
Definition: large_number.h:229
int main()
Main function.
Definition: extended_euclid_algorithm.cpp:87
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:397
uint64_t fib(uint64_t n)
Definition: fibonacci_fast.cpp:30
void test2()
Definition: kohonen_som_topology.cpp:437
bool on_segment(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:75
std::vector< unsigned char > _digits
Definition: large_number.h:285
#define endl
Definition: matrix_exponentiation.cpp:36
void push(Type item)
Definition: stack.h:44
void test2()
Definition: kohonen_som_trace.cpp:305
int main()
Definition: check_prime.cpp:45
bool test2()
Definition: large_factorial.cpp:54
bool isEmptyQueue()
Definition: queue.h:42
Graph(unsigned int vertices, AdjList &&adjList)
Definition: cycle_check_directed_graph.cpp:78
vector< ll > a
Definition: matrix_exponentiation.cpp:53
int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_topology.cpp:60
void test_lamniscate(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:267
int main()
Definition: trie_modern.cpp:160
Definition: bellman_ford.cpp:7
Type top()
Definition: stack.h:54
int data[MAX]
test data
Definition: hash_search.cpp:24
static bool test()
Definition: large_number.h:65
void display()
Definition: queue.h:20
friend bool operator==(large_number const &a, large_number const &b)
Definition: large_number.h:155
friend std::ostream & operator<<(std::ostream &out, const adaline &ada)
Definition: adaline_learning.cpp:72
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
Definition: kohonen_som_topology.cpp:133
unsigned int factorial(unsigned int n)
Definition: factorial.cpp:8
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
Definition: huffman.cpp:28
int main()
Definition: avltree.cpp:134
T sync_with_stdio(T... args)
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_topology.cpp:559
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
int main()
Definition: fast_power.cpp:68
uint64_t double_factorial_recursive(uint64_t n)
Definition: double_factorial.cpp:29
bool search(const std::string &word)
Definition: trie_modern.cpp:132
Definition: knapsack.cpp:4
const uint64_t MAX
Definition: fibonacci_fast.cpp:24
void display()
Definition: stack.h:20
void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:70
void test3()
Definition: kohonen_som_trace.cpp:402
void enQueue(Kind item)
Definition: queue.h:45
bool isEmptyStack()
Definition: stack.h:41
std::remove_reference_t< unsigned int > const & getVertices() const
Definition: cycle_check_directed_graph.cpp:112
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
large_number(int n)
Definition: large_number.h:39
char stack[MAX]
Definition: paranthesis_matching.cpp:20
void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:41
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:186
int main()
Definition: gcd_iterative_euclidean.cpp:47
void test_2d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:318
Definition: line_segment_intersection.cpp:12
friend bool operator!=(large_number const &a, large_number const &b)
Definition: large_number.h:168
void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
Definition: kohonen_som_topology.cpp:259
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
Definition: trie_modern.cpp:64
void test_3d_classes2(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:477
char pop()
pop a byte out of stack variable
Definition: paranthesis_matching.cpp:29
void fit(std::vector< double > const (&X)[N], const int *y)
Definition: adaline_learning.cpp:134
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
void addEdge(Edge const &edge)
Definition: cycle_check_directed_graph.cpp:128
double fast_power_linear(T a, T b)
Definition: fast_power.cpp:50
Graph(unsigned int vertices, AdjList const &adjList)
Definition: cycle_check_directed_graph.cpp:70
large_number & operator++(int)
Definition: large_number.h:183
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
void test2(double eta=0.01)
Definition: adaline_learning.cpp:236
void test3(double eta=0.01)
Definition: adaline_learning.cpp:287
Definition: adaline_learning.cpp:42
int main(int argc, char *argv[])
Main function.
Definition: eulers_totient_function.cpp:48
friend large_number & operator+(const large_number &a, const T &b)
Definition: large_number.h:220
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:145
void clear()
Definition: stack.h:73
int main(int argc, char **argv)
Definition: adaline_learning.cpp:331
void test_circle(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:188
Algorithms_in_C++: math/primes_up_to_billion.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute prime numbers upto 1 billion.
+More...
+
#include <cstring>#include <iostream>
+char prime [100000000]
+
+
Compute prime numbers upto 1 billion.
+
See also prime_numbers.cpp sieve_of_eratosthenes.cpp
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
◆
+
+
+
+
+
+ void Sieve
+ (
+ int64_t
+ n )
+
+
+
+
Perform Sieve algorithm
+
+
+
+
+
17 for (
int p = 2; p * p <= n; p++) {
+
18 if (
prime [p] ==
'1' ) {
+
19 for (
int i = p * p; i <= n; i += p)
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ char prime[100000000]
+
+
+
+
array to store the primes
+
+
+
+
+
void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
char prime[100000000]
Definition: primes_up_to_billion.cpp:10
+
diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..32c050df8
--- /dev/null
+++ b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+175aa14da177cf83432a3084f9ade93c
\ 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
new file mode 100644
index 000000000..a5dc6bae5
--- /dev/null
+++ b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+Sieve
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.html b/d4/da0/gcd__iterative__euclidean_8cpp.html
new file mode 100644
index 000000000..1efb00757
--- /dev/null
+++ b/d4/da0/gcd__iterative__euclidean_8cpp.html
@@ -0,0 +1,231 @@
+
+
+
+Algorithms_in_C++: math/gcd_iterative_euclidean.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
+More...
+
#include <iostream>#include <stdexcept>
+int gcd (int num1, int num2) int main ()
+
+
Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
+
See also gcd_recursive_euclidean.cpp , gcd_of_n_numbers.cpp
+
+
+
◆
+
+
+
+
+
+ int gcd
+ (
+ int
+ num1 ,
+
+ int
+ num2
+
+ )
+
+
+
+
algorithm
+
+
16 if (num1 <= 0 | num2 <= 0) {
+
+
+
+
+
+
+
+
+
25 int previous_remainder = 1;
+
+
+
+
29 previous_remainder = num2;
+
+
+
32 previous_remainder = num1;
+
+
+
35 while ((base_num % previous_remainder) != 0) {
+
36 int old_base = base_num;
+
37 base_num = previous_remainder;
+
38 previous_remainder = old_base % previous_remainder;
+
+
+
41 return previous_remainder;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
int gcd(int num1, int num2)
Definition: gcd_iterative_euclidean.cpp:15
+
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..781fb7858
--- /dev/null
+++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+206605a797664ca9e916f6876993789c
\ 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
new file mode 100644
index 000000000..5fbe7ad64
--- /dev/null
+++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+gcd
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/da4/class_queue.html b/d4/da4/class_queue.html
new file mode 100644
index 000000000..3e5bf1120
--- /dev/null
+++ b/d4/da4/class_queue.html
@@ -0,0 +1,147 @@
+
+
+
+Algorithms_in_C++: Queue Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+createNode (int val) enqueue (int val) dequeue () traverse ()
+
The documentation for this class was generated from the following file:
+data_structures/circular_queue_using_linked_list.cpp
+
+
+
+
diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.md5 b/d4/da4/number__of__positive__divisors_8cpp__incl.md5
new file mode 100644
index 000000000..07b469a56
--- /dev/null
+++ b/d4/da4/number__of__positive__divisors_8cpp__incl.md5
@@ -0,0 +1 @@
+a9574d13c4fc98e06be35d20b3a84993
\ No newline at end of file
diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.svg b/d4/da4/number__of__positive__divisors_8cpp__incl.svg
new file mode 100644
index 000000000..037282a07
--- /dev/null
+++ b/d4/da4/number__of__positive__divisors_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+math/number_of_positive_divisors.cpp
+
+Node1
+
+math/number_of_positive
+_divisors.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/db4/bayes__theorem_8cpp__incl.map b/d4/db4/bayes__theorem_8cpp__incl.map
new file mode 100644
index 000000000..d396f713f
--- /dev/null
+++ b/d4/db4/bayes__theorem_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d4/db4/bayes__theorem_8cpp__incl.md5 b/d4/db4/bayes__theorem_8cpp__incl.md5
new file mode 100644
index 000000000..8c6b2affc
--- /dev/null
+++ b/d4/db4/bayes__theorem_8cpp__incl.md5
@@ -0,0 +1 @@
+be15fb7a8799a143bea6ea5a5ed86386
\ No newline at end of file
diff --git a/d4/db4/bayes__theorem_8cpp__incl.svg b/d4/db4/bayes__theorem_8cpp__incl.svg
new file mode 100644
index 000000000..3d865a8ff
--- /dev/null
+++ b/d4/db4/bayes__theorem_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+probability/bayes_theorem.cpp
+
+Node1
+
+probability/bayes_theorem.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d4/db4/struct_segment_intersection.html b/d4/db4/struct_segment_intersection.html
new file mode 100644
index 000000000..5377e2bc8
--- /dev/null
+++ b/d4/db4/struct_segment_intersection.html
@@ -0,0 +1,240 @@
+
+
+
+Algorithms_in_C++: SegmentIntersection Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
intersect returns true if segments of two line intersects and false if they do not. It calls the subroutines direction which computes the orientation.
+
+
+
◆
+
+
+
+
+
+
+
+
+ int SegmentIntersection::direction
+ (
+ Point first_point ,
+
+ Point second_point ,
+
+ Point third_point
+
+ )
+
+
+
+
+inline
+
+
+
+
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.
+
+
65 return ((third_point.x - first_point.x) *
+
66 (second_point.
y - first_point.
y )) -
+
67 ((second_point.x - first_point.x) *
+
68 (third_point.
y - first_point.
y ));
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ bool SegmentIntersection::on_segment
+ (
+ Point first_point ,
+
+ Point second_point ,
+
+ Point third_point
+
+ )
+
+
+
+
+inline
+
+
+
+
This method determines whether a point known to be colinear with a segment lies on that segment.
+
+
77 if (
std::min (first_point.x, second_point.x) <= third_point.x &&
+
78 third_point.x <=
std::max (first_point.x, second_point.x) &&
+
79 std::min (first_point.
y , second_point.
y ) <= third_point.
y &&
+
80 third_point.
y <=
std::max (first_point.
y , second_point.
y ))
+
+
+
+
+
+
+
+
+
+
+
The documentation for this struct was generated from the following file:
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5
new file mode 100644
index 000000000..c82fbf4a8
--- /dev/null
+++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5
@@ -0,0 +1 @@
+0d3dcb1f7c3e3c31812e4d31ccbec50a
\ 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
new file mode 100644
index 000000000..e64e2460e
--- /dev/null
+++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+SegmentIntersection::on_segment
+
+Node1
+
+SegmentIntersection
+::on_segment
+
+
+
+
+Node2
+
+std::max
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::min
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/db6/struct_min_heap_node-members.html b/d4/db6/struct_min_heap_node-members.html
new file mode 100644
index 000000000..c4af233d9
--- /dev/null
+++ b/d4/db6/struct_min_heap_node-members.html
@@ -0,0 +1,116 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for MinHeapNode , including all inherited members.
+
+
+
diff --git a/d4/dbd/structlca__coll__graph.md5 b/d4/dbd/structlca__coll__graph.md5
new file mode 100644
index 000000000..5421828d9
--- /dev/null
+++ b/d4/dbd/structlca__coll__graph.md5
@@ -0,0 +1 @@
+7f86281226cb492a8d0c40cb3c589dd0
\ No newline at end of file
diff --git a/d4/dbd/structlca__coll__graph.svg b/d4/dbd/structlca__coll__graph.svg
new file mode 100644
index 000000000..d9f064194
--- /dev/null
+++ b/d4/dbd/structlca__coll__graph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+lca
+
+Node1
+
+lca
+
+
+
+
+Node2
+
+std::vector< int >
+
+
+
+
+Node2->Node1
+ adj
+
+
+
diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.map b/d4/dc7/extended__euclid__algorithm_8cpp__incl.map
new file mode 100644
index 000000000..5cf4eab0a
--- /dev/null
+++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 b/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5
new file mode 100644
index 000000000..e13985bfc
--- /dev/null
+++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5
@@ -0,0 +1 @@
+6a99876479612571fa194294f0b387ea
\ No newline at end of file
diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg
new file mode 100644
index 000000000..d644284e7
--- /dev/null
+++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+math/extended_euclid_algorithm.cpp
+
+Node1
+
+math/extended_euclid
+_algorithm.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map
new file mode 100644
index 000000000..a52e49ce0
--- /dev/null
+++ b/d4/dcb/classstack__coll__graph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5
new file mode 100644
index 000000000..53818cc26
--- /dev/null
+++ b/d4/dcb/classstack__coll__graph.md5
@@ -0,0 +1 @@
+b0de418348dc0917885546f01816203b
\ No newline at end of file
diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg
new file mode 100644
index 000000000..f9568bf2f
--- /dev/null
+++ b/d4/dcb/classstack__coll__graph.svg
@@ -0,0 +1,76 @@
+
+
+
+
+
+
+stack< Type >
+
+Node1
+
+stack< Type >
+
+
+
+
+Node2
+
+node< Type >
+
+
+
+
+Node2->Node1
+ stackTop
+
+
+
+Node2->Node2
+ next
+
+
+
+Node3
+
+node< Kind >
+
+
+
+
+Node3->Node2
+ prev
+next
+right
+left
+link
+
+
+
+Node3->Node3
+ prev
+next
+right
+left
+link
+
+
+
diff --git a/d4/dd9/structtrie.html b/d4/dd9/structtrie.html
new file mode 100644
index 000000000..dae64e462
--- /dev/null
+++ b/d4/dd9/structtrie.html
@@ -0,0 +1,131 @@
+
+
+
+Algorithms_in_C++: trie Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+trie * arr [26] isEndofWord
+
The documentation for this struct was generated from the following file:
+data_structures/trie_tree.cpp
+
+
+
Algorithms_in_C++: others/fast_interger_input.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Read integers from stdin continuously as they are entered without waiting for the \n character.
+More...
+
#include <iostream>
+
+
Read integers from stdin continuously as they are entered without waiting for the \n character.
+
+
+
◆
+
+
+
+
+
+ void fastinput
+ (
+ int *
+ number )
+
+
+
+
Function to read the number from stdin. The function reads input until a non numeric character is entered.
+
+
+
13 bool negative =
false ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
30 *number = *number * 10 + c - 48;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
+
diff --git a/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..7d46a30fc
--- /dev/null
+++ b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+5bc3050e4916da5b438a1fc3738b9cb7
\ No newline at end of file
diff --git a/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..1dd95d35c
--- /dev/null
+++ b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+fastinput
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.map b/d4/deb/gcd__iterative__euclidean_8cpp__incl.map
new file mode 100644
index 000000000..d43619262
--- /dev/null
+++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 b/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5
new file mode 100644
index 000000000..0e6f12702
--- /dev/null
+++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5
@@ -0,0 +1 @@
+ba1669f8a58ffa4a5dba151c4a8cfacc
\ No newline at end of file
diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg
new file mode 100644
index 000000000..e56720d15
--- /dev/null
+++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+math/gcd_iterative_euclidean.cpp
+
+Node1
+
+math/gcd_iterative
+_euclidean.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+stdexcept
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html
new file mode 100644
index 000000000..9a0d61d26
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp.html
@@ -0,0 +1,693 @@
+
+
+
+Algorithms_in_C++: machine_learning/kohonen_som_topology.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Kohonen self organizing map (topological map)
+More...
+
#include <algorithm>#include <cmath>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>#include <vector>
+
+#define _USE_MATH_DEFINES MIN_DISTANCE 1e-4 Minimum average distance of image nodes.
+double _random (double a , double b) int save_2d_data (const char *fname, const std::vector < std::valarray < double >> &X) void get_min_2d (const std::vector < std::valarray < double >> &X, double *val, int *x_idx, int *y_idx) int machine_learning::save_u_matrix (const char *fname, const std::vector < std::vector < std::valarray < double >>> &W) double machine_learning::update_weights (const std::valarray < double > &X, std::vector < std::vector < std::valarray < double >>> *W, std::vector < std::valarray < double >> *D, double alpha, int R) void machine_learning::kohonen_som (const std::vector < std::valarray < double >> &X, std::vector < std::vector < std::valarray < double >>> *W, double alpha_min) void test_2d_classes (std::vector < std::valarray < double >> *data ) void test1 () void test_3d_classes1 (std::vector < std::valarray < double >> *data ) void test2 () void test_3d_classes2 (std::vector < std::valarray < double >> *data ) void test3 () double get_clock_diff (clock_t start_t, clock_t end_t) int main (int argc, char **argv)
+
+
Kohonen self organizing map (topological map)
+
Author Krishna Vedala This example implements a powerful unsupervised learning algorithm called as a self organizing map. The algorithm creates a connected network of weights that closely follows the given data points. This thus creates a topological map of the given data i.e., it maintains the relationship between varipus data points in a much higher dimesional space by creating an equivalent in a 2-dimensional space.
+
Note This C++ version of the program is considerable slower than its C counterpart
+
+The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows
+
See also kohonen_som_trace.cpp
+
+
+
◆
+
+
+
+
+
+ double get_clock_diff
+ (
+ clock_t
+ start_t ,
+
+ clock_t
+ end_t
+
+ )
+
+
+
+
Convert clock cycle difference to time in seconds
+
Parameters
+
+ [in] start_t start clock [in] end_t end clock
+
+
+
Returns time difference in seconds
+
+
560 return static_cast< double > (end_t - start_t) / CLOCKS_PER_SEC;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
Main function
+
+
+
566 std::cout <<
"Using OpenMP based parallelization\n" ;
+
+
568 std::cout <<
"NOT using OpenMP based parallelization\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
592 <<
"(Note: Calculated times include: creating test sets, training "
+
593 "model and writing files to disk.)\n\n" ;
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test1
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed in four clusters in circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
+test1.csv: random test samples points with a circular patternw11.csv: initial random mapw12.csv: trained SOM map
+
+
+
+
+
+
+
363 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
369 for (
int k = 0;
k < num_out;
k ++) {
+
+
+
+
+
374 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:
+test2.csv: random test samples points with a lamniscate patternw21.csv: initial random mapw22.csv: trained SOM map
+
+
+
+
+
+
+
443 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
449 for (
int k = 0;
k < num_out;
k ++) {
+
+
+
+
+
454 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test3
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:
+test3.csv: random test samples points with a circular patternw31.csv: initial random mapw32.csv: trained SOM map
+
+
+
+
+
+
+
527 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
533 for (
int k = 0;
k < num_out;
k ++) {
+
+
+
+
+
538 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
+\((0,5, 0.5, 0.5)\)
+\((0,5,-0.5, -0.5)\)
+\((-0,5, 0.5, 0.5)\)
+\((-0,5,-0.5, -0.5)\)
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
319 const int N =
data ->size();
+
320 const double R = 0.3;
+
+
322 const int num_classes = 4;
+
323 const double centres[][2] = {
+
+
+
+
+
+
+
+
+
+
+
334 for (i = 0; i < N; i++) {
+
+
+
+
+
339 data [0][i][0] =
_random (centres[cls][0] - R, centres[cls][0] + R);
+
340 data [0][i][1] =
_random (centres[cls][1] - R, centres[cls][1] + R);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
+\((0,5, 0.5, 0.5)\)
+\((0,5,-0.5, -0.5)\)
+\((-0,5, 0.5, 0.5)\)
+\((-0,5,-0.5, -0.5)\)
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
398 const int N =
data ->size();
+
399 const double R = 0.3;
+
+
401 const int num_classes = 4;
+
402 const double centres[][3] = {
+
+
+
+
+
+
+
+
+
+
+
413 for (i = 0; i < N; i++) {
+
+
+
+
+
418 data [0][i][0] =
_random (centres[cls][0] - R, centres[cls][0] + R);
+
419 data [0][i][1] =
_random (centres[cls][1] - R, centres[cls][1] + R);
+
420 data [0][i][2] =
_random (centres[cls][2] - R, centres[cls][2] + R);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed in four clusters in 3D space with centroids at the points
+\((0,5, 0.5, 0.5)\)
+\((0,5,-0.5, -0.5)\)
+\((-0,5, 0.5, 0.5)\)
+\((-0,5,-0.5, -0.5)\)
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
478 const int N =
data ->size();
+
479 const double R = 0.2;
+
+
481 const int num_classes = 8;
+
482 const double centres[][3] = {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
497 for (i = 0; i < N; i++) {
+
+
+
+
+
502 data [0][i][0] =
_random (centres[cls][0] - R, centres[cls][0] + R);
+
503 data [0][i][1] =
_random (centres[cls][1] - R, centres[cls][1] + R);
+
504 data [0][i][2] =
_random (centres[cls][2] - R, centres[cls][2] + R);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void test1()
Definition: kohonen_som_topology.cpp:357
void test3()
Definition: kohonen_som_topology.cpp:521
ll k
Definition: matrix_exponentiation.cpp:48
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:397
void test2()
Definition: kohonen_som_topology.cpp:437
int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_topology.cpp:60
int data[MAX]
test data
Definition: hash_search.cpp:24
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
Definition: kohonen_som_topology.cpp:133
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_topology.cpp:559
void test_2d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:318
void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
Definition: kohonen_som_topology.cpp:259
void test_3d_classes2(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:477
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
new file mode 100644
index 000000000..9ebdd8d8f
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -0,0 +1 @@
+2212341558ef92b106f3c22b810aefd9
\ 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
new file mode 100644
index 000000000..c4cee394c
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -0,0 +1,466 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_3d_classes1
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
new file mode 100644
index 000000000..6532132a0
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -0,0 +1,378 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_3d_classes1
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map
new file mode 100644
index 000000000..c66f43392
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5
new file mode 100644
index 000000000..97e5dd59b
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5
@@ -0,0 +1 @@
+b88cf6ab42c98e33a2a6b6263d3379c3
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg
new file mode 100644
index 000000000..f74b53d91
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+test_3d_classes2
+
+Node1
+
+test_3d_classes2
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
new file mode 100644
index 000000000..8f20f0952
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
@@ -0,0 +1,25 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
new file mode 100644
index 000000000..6a99a748a
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
@@ -0,0 +1 @@
+244b6433450f7a6dfcf4edcfb0b19853
\ 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
new file mode 100644
index 000000000..a92dd8a96
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@@ -0,0 +1,466 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_2d_classes
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
new file mode 100644
index 000000000..9e2038040
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
@@ -0,0 +1,378 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_2d_classes
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
new file mode 100644
index 000000000..0f52ca1cb
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
@@ -0,0 +1,34 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..2bbe7c675
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+955081ca737810043903e417b4ddcfff
\ 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
new file mode 100644
index 000000000..4ffbe3719
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,685 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+get_clock_diff
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::srand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+test1
+
+
+
+
+Node1->Node5
+
+
+
+Node28
+
+test2
+
+
+
+
+Node1->Node28
+
+
+
+Node30
+
+test3
+
+
+
+
+Node1->Node30
+
+
+
+Node32
+
+std::time
+
+
+
+
+Node1->Node32
+
+
+
+Node6
+
+_random
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+machine_learning::kohonen_som
+
+
+
+
+Node5->Node7
+
+
+
+Node15
+
+std::max
+
+
+
+
+Node5->Node15
+
+
+
+Node18
+
+save_2d_data
+
+
+
+
+Node5->Node18
+
+
+
+Node22
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node5->Node22
+
+
+
+Node26
+
+test_2d_classes
+
+
+
+
+Node5->Node26
+
+
+
+Node8
+
+machine_learning::update
+_weights
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::exp
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+get_min_2d
+
+
+
+
+Node8->Node10
+
+
+
+Node8->Node15
+
+
+
+Node16
+
+std::min
+
+
+
+
+Node8->Node16
+
+
+
+Node17
+
+std::sqrt
+
+
+
+
+Node8->Node17
+
+
+
+Node11
+
+std::begin
+
+
+
+
+Node10->Node11
+
+
+
+Node12
+
+std::distance
+
+
+
+
+Node10->Node12
+
+
+
+Node13
+
+std::end
+
+
+
+
+Node10->Node13
+
+
+
+Node14
+
+std::min_element
+
+
+
+
+Node10->Node14
+
+
+
+Node19
+
+std::ofstream::close
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::ofstream::is_open
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::ofstream::open
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node17
+
+
+
+Node22->Node19
+
+
+
+Node23
+
+std::perror
+
+
+
+
+Node22->Node23
+
+
+
+Node24
+
+std::pow
+
+
+
+
+Node22->Node24
+
+
+
+Node25
+
+std::snprintf
+
+
+
+
+Node22->Node25
+
+
+
+Node26->Node6
+
+
+
+Node27
+
+std::rand
+
+
+
+
+Node26->Node27
+
+
+
+Node28->Node6
+
+
+
+Node28->Node7
+
+
+
+Node28->Node15
+
+
+
+Node28->Node18
+
+
+
+Node28->Node22
+
+
+
+Node29
+
+test_3d_classes1
+
+
+
+
+Node28->Node29
+
+
+
+Node29->Node6
+
+
+
+Node29->Node27
+
+
+
+Node30->Node6
+
+
+
+Node30->Node7
+
+
+
+Node30->Node15
+
+
+
+Node30->Node18
+
+
+
+Node30->Node22
+
+
+
+Node31
+
+test_3d_classes2
+
+
+
+
+Node30->Node31
+
+
+
+Node31->Node6
+
+
+
+Node31->Node27
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
new file mode 100644
index 000000000..bfb012f64
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
@@ -0,0 +1,597 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+get_clock_diff
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::srand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+test1
+
+
+
+
+Node1->Node5
+
+
+
+Node28
+
+test2
+
+
+
+
+Node1->Node28
+
+
+
+Node30
+
+test3
+
+
+
+
+Node1->Node30
+
+
+
+Node32
+
+std::time
+
+
+
+
+Node1->Node32
+
+
+
+Node6
+
+_random
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+machine_learning::kohonen_som
+
+
+
+
+Node5->Node7
+
+
+
+Node15
+
+std::max
+
+
+
+
+Node5->Node15
+
+
+
+Node18
+
+save_2d_data
+
+
+
+
+Node5->Node18
+
+
+
+Node22
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node5->Node22
+
+
+
+Node26
+
+test_2d_classes
+
+
+
+
+Node5->Node26
+
+
+
+Node8
+
+machine_learning::update
+_weights
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::exp
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+get_min_2d
+
+
+
+
+Node8->Node10
+
+
+
+Node8->Node15
+
+
+
+Node16
+
+std::min
+
+
+
+
+Node8->Node16
+
+
+
+Node17
+
+std::sqrt
+
+
+
+
+Node8->Node17
+
+
+
+Node11
+
+std::begin
+
+
+
+
+Node10->Node11
+
+
+
+Node12
+
+std::distance
+
+
+
+
+Node10->Node12
+
+
+
+Node13
+
+std::end
+
+
+
+
+Node10->Node13
+
+
+
+Node14
+
+std::min_element
+
+
+
+
+Node10->Node14
+
+
+
+Node19
+
+std::ofstream::close
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::ofstream::is_open
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::ofstream::open
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node17
+
+
+
+Node22->Node19
+
+
+
+Node23
+
+std::perror
+
+
+
+
+Node22->Node23
+
+
+
+Node24
+
+std::pow
+
+
+
+
+Node22->Node24
+
+
+
+Node25
+
+std::snprintf
+
+
+
+
+Node22->Node25
+
+
+
+Node26->Node6
+
+
+
+Node27
+
+std::rand
+
+
+
+
+Node26->Node27
+
+
+
+Node28->Node6
+
+
+
+Node28->Node7
+
+
+
+Node28->Node15
+
+
+
+Node28->Node18
+
+
+
+Node28->Node22
+
+
+
+Node29
+
+test_3d_classes1
+
+
+
+
+Node28->Node29
+
+
+
+Node29->Node6
+
+
+
+Node29->Node27
+
+
+
+Node30->Node6
+
+
+
+Node30->Node7
+
+
+
+Node30->Node15
+
+
+
+Node30->Node18
+
+
+
+Node30->Node22
+
+
+
+Node31
+
+test_3d_classes2
+
+
+
+
+Node30->Node31
+
+
+
+Node31->Node6
+
+
+
+Node31->Node27
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map
new file mode 100644
index 000000000..f0b545590
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5
new file mode 100644
index 000000000..66b73a5e4
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5
@@ -0,0 +1 @@
+3e030538f835f5236201c24a8ade6fc1
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg
new file mode 100644
index 000000000..09c64cef4
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+test_2d_classes
+
+Node1
+
+test_2d_classes
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
new file mode 100644
index 000000000..921c76736
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
@@ -0,0 +1,25 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
new file mode 100644
index 000000000..0f07023f9
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
@@ -0,0 +1 @@
+2dd729dcb1c0d3d338426f92d735d1e9
\ 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
new file mode 100644
index 000000000..cf1fdabb0
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
@@ -0,0 +1,466 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_3d_classes2
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
new file mode 100644
index 000000000..e482cd6a5
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
@@ -0,0 +1,378 @@
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen_som
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_2d_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node1->Node18
+
+
+
+Node22
+
+test_3d_classes2
+
+
+
+
+Node1->Node22
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node13
+
+
+
+Node18->Node15
+
+
+
+Node19
+
+std::perror
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::pow
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::snprintf
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node2
+
+
+
+Node23
+
+std::rand
+
+
+
+
+Node22->Node23
+
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map
new file mode 100644
index 000000000..9efd2bd2e
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5
new file mode 100644
index 000000000..0b0eba333
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5
@@ -0,0 +1 @@
+246e70d9ccd7a6bbfdd3e197979233e9
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg
new file mode 100644
index 000000000..e668bbc3c
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+test_3d_classes1
+
+Node1
+
+test_3d_classes1
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d4/df8/prime__numbers_8cpp__incl.map b/d4/df8/prime__numbers_8cpp__incl.map
new file mode 100644
index 000000000..d5a4d6631
--- /dev/null
+++ b/d4/df8/prime__numbers_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d4/df8/prime__numbers_8cpp__incl.md5 b/d4/df8/prime__numbers_8cpp__incl.md5
new file mode 100644
index 000000000..77e3172a3
--- /dev/null
+++ b/d4/df8/prime__numbers_8cpp__incl.md5
@@ -0,0 +1 @@
+3bbb4098a01d35ff40f1af5d62fd207c
\ No newline at end of file
diff --git a/d4/df8/prime__numbers_8cpp__incl.svg b/d4/df8/prime__numbers_8cpp__incl.svg
new file mode 100644
index 000000000..af57e8558
--- /dev/null
+++ b/d4/df8/prime__numbers_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/prime_numbers.cpp
+
+Node1
+
+math/prime_numbers.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html
new file mode 100644
index 000000000..d744d06ff
--- /dev/null
+++ b/d5/d15/classcll.html
@@ -0,0 +1,157 @@
+
+
+
+Algorithms_in_C++: cll Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+display () insert_front (int new_data) insert_tail (int new_data) get_size () find_item (int item_to_find) operator* () operator++ ()
+node * head total
+
The documentation for this class was generated from the following files:
+data_structures/cll/cll.h
+data_structures/cll/cll.cpp
+
+
+
Algorithms_in_C++: MinHeapNode Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+MinHeapNode (char data, unsigned freq)
+
The documentation for this struct was generated from the following file:
+greedy_algorithms/huffman.cpp
+
+
+
Algorithms_in_C++: probability/bayes_theorem.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Bayes' theorem
+More...
+
#include <iostream>
+
+
Bayes' theorem
+
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)\).
+
+
+
◆
+
+
+
+
+
+ double bayes_AgivenB
+ (
+ double
+ BgivenA ,
+
+ double
+ A ,
+
+ double
+ B
+
+ )
+
+
+
+
returns P(A|B)
+
+
15 return (BgivenA * A) / B;
+
+
+
+
+
+
◆
+
+
+
+
+
+ double bayes_BgivenA
+ (
+ double
+ AgivenB ,
+
+ double
+ A ,
+
+ double
+ B
+
+ )
+
+
+
+
returns P(B|A)
+
+
21 return (AgivenB * B) / A;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
double bayes_BgivenA(double AgivenB, double A, double B)
Definition: bayes_theorem.cpp:20
double bayes_AgivenB(double BgivenA, double A, double B)
Definition: bayes_theorem.cpp:14
+
diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..c86d21849
--- /dev/null
+++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+718425e2eede875e538fb847db93f736
\ 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
new file mode 100644
index 000000000..d216d280d
--- /dev/null
+++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+bayes_AgivenB
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+bayes_BgivenA
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node1->Node4
+
+
+
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
new file mode 100644
index 000000000..b4312d016
--- /dev/null
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -0,0 +1,372 @@
+
+
+
+Algorithms_in_C++: List of all files
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/d8b/least__common__multiple_8cpp__incl.md5 b/d5/d8b/least__common__multiple_8cpp__incl.md5
new file mode 100644
index 000000000..96095fe96
--- /dev/null
+++ b/d5/d8b/least__common__multiple_8cpp__incl.md5
@@ -0,0 +1 @@
+d4fba7214129761f4d2eac8f32cdd94a
\ No newline at end of file
diff --git a/d5/d8b/least__common__multiple_8cpp__incl.svg b/d5/d8b/least__common__multiple_8cpp__incl.svg
new file mode 100644
index 000000000..201234857
--- /dev/null
+++ b/d5/d8b/least__common__multiple_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/least_common_multiple.cpp
+
+Node1
+
+math/least_common_multiple.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html
new file mode 100644
index 000000000..c159ba0c4
--- /dev/null
+++ b/d5/d91/namespacesorting.html
@@ -0,0 +1,606 @@
+
+
+
+Algorithms_in_C++: sorting Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Sorting algorithms.
+More...
+
+template<class Iterator > void merge (Iterator l, Iterator r, const Iterator e, char b[]) merges 2 sorted adjacent segments into a larger sorted segment More... template<class Iterator > void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n) bottom-up merge sort which sorts elements in a non-decreasing order More... template<class Iterator > void non_recursive_merge_sort (const Iterator first, const size_t n) bottom-up merge sort which sorts elements in a non-decreasing order More... template<class Iterator > void non_recursive_merge_sort (const Iterator first, const Iterator last) bottom-up merge sort which sorts elements in a non-decreasing order More... int partition (int arr[], int low, int high) void quickSort (int arr[], int low, int high) template<typename T > void shell_sort (T *arr, size_t LEN) template<typename T , size_t N> void shell_sort (T(&arr)[N]) template<typename T > void shell_sort (std::vector < T > *arr)
+
+
+
+
◆
+
+
+
+
+template<class Iterator >
+
+
+ void sorting::merge
+ (
+ Iterator
+ l ,
+
+ Iterator
+ r ,
+
+ const Iterator
+ e ,
+
+ char
+ b []
+
+ )
+
+
+
+
+
merges 2 sorted adjacent segments into a larger sorted segment
+
best-case = worst-case = O(n)
Parameters
+
+ l points to the left part r points to the right part, end of left part e points to end of right part b points at the buffer
+
+
+
+
+
59 auto p(
reinterpret_cast< std::remove_reference_t<decltype(*l)
> *>(b)), c(p);
+
+
61 for (Iterator t(l); r != t; ++t) *p++ =
std::move (*t);
+
+
+
64 while (e != r && c != p) *l++ =
std::move (*r < *c ? *r++ : *c++);
+
+
+
+
+
+
+
+
+
+
+
◆ [1/3]
+
+
+
+
+template<class Iterator >
+
+
+ void sorting::non_recursive_merge_sort
+ (
+ const Iterator
+ first ,
+
+ const Iterator
+ last
+
+ )
+
+
+
+
+
bottom-up merge sort which sorts elements in a non-decreasing order
+
Parameters
+
+ first points to the first element last points to 1-step past the last element
+
+
+
+
+
+
+
+
+
◆ [2/3]
+
+
+
+
+template<class Iterator >
+
+
+ void sorting::non_recursive_merge_sort
+ (
+ const Iterator
+ first ,
+
+ const Iterator
+ last ,
+
+ const size_t
+ n
+
+ )
+
+
+
+
+
bottom-up merge sort which sorts elements in a non-decreasing order
+
sorts elements non-recursively by breaking them into small segments, merging adjacent segments into larger sorted segments, then increasing the sizes of segments by factors of 2 and repeating the same process. best-case = worst-case = O(n log(n))
Parameters
+
+ first points to the first element last points to 1-step past the last element n the number of elements
+
+
+
+
+
+
29 char * buffer =
new char [n *
sizeof (*first)];
+
+
+
+
33 for (
size_t length(1); length < n; length <<= 1) {
+
+
+
36 for (
size_t counter(n / (length << 1)); counter; --counter) {
+
37 Iterator
right (left + length),
end (right + length);
+
38 merge (left, right, end, buffer);
+
+
+
+
+
43 if ((n & ((length << 1) - 1)) > length)
+
44 merge (left, left + length, last, buffer);
+
+
+
+
+
+
+
+
+
+
◆ [3/3]
+
+
+
+
+template<class Iterator >
+
+
+ void sorting::non_recursive_merge_sort
+ (
+ const Iterator
+ first ,
+
+ const size_t
+ n
+
+ )
+
+
+
+
+
bottom-up merge sort which sorts elements in a non-decreasing order
+
Parameters
+
+ first points to the first element n the number of elements
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int sorting::partition
+ (
+ int
+ arr [],
+
+ int
+ low ,
+
+ int
+ high
+
+ )
+
+
+
+
This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot
+
+
38 int pivot = arr[high];
+
+
+
41 for (
int j = low; j < high; j++) {
+
+
+
44 if (arr[j] <= pivot) {
+
+
+
+
+
+
+
51 int temp = arr[i + 1];
+
52 arr[i + 1] = arr[high];
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void sorting::quickSort
+ (
+ int
+ arr [],
+
+ int
+ low ,
+
+ int
+ high
+
+ )
+
+
+
+
The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index
+
+
+
+
+
+
+
◆ [1/3]
+
+
+
+
+template<typename T >
+
+
+ void sorting::shell_sort
+ (
+ std::vector < T > * arr )
+
+
+
+
function overload - when input array is of type std::vector , simply send the data content and the data length to the above function.
+
+
+
+
+
+
+
◆ [2/3]
+
+
+
+
+template<typename T >
+
+
+ void sorting::shell_sort
+ (
+ T *
+ arr ,
+
+ size_t
+ LEN
+
+ )
+
+
+
+
Optimized algorithm - takes half the time by utilizing Mar
+
+
46 const unsigned int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};
+
47 const unsigned int gap_len = 8;
+
+
+
50 for (g = 0; g < gap_len; g++) {
+
51 unsigned int gap = gaps[g];
+
52 for (i = gap; i < LEN; i++) {
+
+
+
55 for (j = i; j >= gap && (arr[j - gap] - tmp) > 0; j -= gap) {
+
56 arr[j] = arr[j - gap];
+
+
+
+
+
+
+
+
+
+
+
◆ [3/3]
+
+
+
+
+template<typename T , size_t N>
+
+
+ void sorting::shell_sort
+ (
+ T(&)
+ arr [N])
+
+
+
+
function overload - when input array is of a known length array type
+
+
+
+
+
+
+
int partition(int arr[], int low, int high)
Definition: quick_sort.cpp:37
void merge(Iterator, Iterator, const Iterator, char[])
merges 2 sorted adjacent segments into a larger sorted segment
Definition: non_recursive_merge_sort.cpp:57
void non_recursive_merge_sort(const Iterator first, const Iterator last)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:86
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
new file mode 100644
index 000000000..34493823b
--- /dev/null
+++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
@@ -0,0 +1 @@
+2c67bfbae0f7a99a140344c2e6377117
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
new file mode 100644
index 000000000..e8d7a00e2
--- /dev/null
+++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+sorting::non_recursive_merge_sort
+
+Node1
+
+sorting::non_recursive
+_merge_sort
+
+
+
+
+Node2
+
+sorting::merge
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
new file mode 100644
index 000000000..0e7bb9b94
--- /dev/null
+++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
new file mode 100644
index 000000000..9a973be86
--- /dev/null
+++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
@@ -0,0 +1 @@
+0a7657a7dba6aa5f59c7d53ff282bea7
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
new file mode 100644
index 000000000..38af1823f
--- /dev/null
+++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
@@ -0,0 +1,54 @@
+
+
+
+
+
+
+sorting::non_recursive_merge_sort
+
+Node1
+
+sorting::non_recursive
+_merge_sort
+
+
+
+
+Node2
+
+sorting::non_recursive
+_merge_sort
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+sorting::merge
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
new file mode 100644
index 000000000..8259bb9a1
--- /dev/null
+++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
new file mode 100644
index 000000000..9ff4dceb7
--- /dev/null
+++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
@@ -0,0 +1 @@
+b684df4aa9e5be54b7a23a1903a92e66
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
new file mode 100644
index 000000000..06679387e
--- /dev/null
+++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+sorting::shell_sort
+
+Node1
+
+sorting::shell_sort
+
+
+
+
+Node2
+
+sorting::shell_sort
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map
new file mode 100644
index 000000000..a0da5b50f
--- /dev/null
+++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5
new file mode 100644
index 000000000..8715ffdc6
--- /dev/null
+++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5
@@ -0,0 +1 @@
+bd47edf295ad452b0aba2ed1b14bc86a
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg
new file mode 100644
index 000000000..63b698316
--- /dev/null
+++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+sorting::quickSort
+
+Node1
+
+sorting::quickSort
+
+
+
+
+Node2
+
+sorting::partition
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
new file mode 100644
index 000000000..0e7bb9b94
--- /dev/null
+++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
new file mode 100644
index 000000000..9a973be86
--- /dev/null
+++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
@@ -0,0 +1 @@
+0a7657a7dba6aa5f59c7d53ff282bea7
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
new file mode 100644
index 000000000..38af1823f
--- /dev/null
+++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
@@ -0,0 +1,54 @@
+
+
+
+
+
+
+sorting::non_recursive_merge_sort
+
+Node1
+
+sorting::non_recursive
+_merge_sort
+
+
+
+
+Node2
+
+sorting::non_recursive
+_merge_sort
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+sorting::merge
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
new file mode 100644
index 000000000..8259bb9a1
--- /dev/null
+++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
new file mode 100644
index 000000000..9ff4dceb7
--- /dev/null
+++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
@@ -0,0 +1 @@
+b684df4aa9e5be54b7a23a1903a92e66
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
new file mode 100644
index 000000000..06679387e
--- /dev/null
+++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+sorting::shell_sort
+
+Node1
+
+sorting::shell_sort
+
+
+
+
+Node2
+
+sorting::shell_sort
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html
new file mode 100644
index 000000000..561033c55
--- /dev/null
+++ b/d5/da1/structnode.html
@@ -0,0 +1,197 @@
+
+
+
+Algorithms_in_C++: node< Kind > Class Template Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <queue.h >
+
+
+
+data height node * left node * right val node * left node * right node * next node * next node * prev data node < Kind > * next data node < Type > * next node * link
+
+
template<class Kind>
+
+
Definition of the node
+
The documentation for this class was generated from the following files:
+data_structures/avltree.cpp
+data_structures/binary_search_tree.cpp
+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
+data_structures/stack_using_linked_list.cpp
+data_structures/tree.cpp
+operations_on_datastructures/circular_linked_list.cpp
+operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
+operations_on_datastructures/selectionsortlinkedlist.cpp
+
+
+
Algorithms_in_C++: machine_learning/adaline_learning.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Adaptive Linear Neuron (ADALINE) implementation
+More...
+
#include <cassert>#include <climits>#include <cmath>#include <cstdlib>#include <ctime>#include <iostream>#include <numeric>#include <vector>
+
+#define MAX_ITER 500
+void test1 (double eta=0.01) void test2 (double eta=0.01) void test3 (double eta=0.01) int main (int argc, char **argv)
+
+
Adaptive Linear Neuron (ADALINE) implementation
+
Author Krishna Vedala
+
source ADALINE is one of the first and simplest single layer artificial neural network. The algorithm essentially implements a linear function
+\[ f\left(x_0,x_1,x_2,\ldots\right) = \sum_j x_jw_j+\theta \]
+
+
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.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
Main function
+
+
+
+
+
+
336 eta =
strtof (argv[1],
nullptr );
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test1
+ (
+ double
+ eta = 0.01)
+
+
+
+
test function to predict points in a 2D coordinate system above the line \(x=y\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features.
Parameters
+
+ [in] eta learning rate (optional, default=0.01)
+
+
+
+
+
+
+
+
+
208 {4, 1}, {6, -5}, {-7, -3}, {-8, 5},
+
209 {-9, 2}, {-10, -15}};
+
210 int y[] = {1, -1, 1, -1, -1, -1, 1, 1, 1, -1};
+
+
+
+
+
+
+
+
218 int predict = ada.predict({5, -3});
+
219 std::cout <<
"Predict for x=(5,-3): " << predict;
+
220 assert(predict == -1);
+
+
+
223 predict = ada.predict({5, 8});
+
224 std::cout <<
"Predict for x=(5,8): " << predict;
+
225 assert(predict == 1);
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ double
+ eta = 0.01)
+
+
+
+
test function to predict points in a 2D coordinate system above the line \(x+3y=-1\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features. The function will create random sample points for training and test purposes.
Parameters
+
+ [in] eta learning rate (optional, default=0.01)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
247 int range2 = range >> 1;
+
248 for (
int i = 0; i < N; i++) {
+
249 double x0 = ((
std::rand () % range) - range2) / 100.f;
+
250 double x1 = ((
std::rand () % range) - range2) / 100.f;
+
+
252 Y[i] = (x0 + 3. * x1) > -1 ? 1 : -1;
+
+
+
+
+
+
+
+
+
261 int N_test_cases = 5;
+
262 for (
int i = 0; i < N_test_cases; i++) {
+
263 double x0 = ((
std::rand () % range) - range2) / 100.f;
+
264 double x1 = ((
std::rand () % range) - range2) / 100.f;
+
+
266 int predict = ada.predict({x0, x1});
+
+
268 std::cout <<
"Predict for x=(" << x0 <<
"," << x1 <<
"): " << predict;
+
+
270 int expected_val = (x0 + 3. * x1) > -1 ? 1 : -1;
+
271 assert(predict == expected_val);
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test3
+ (
+ double
+ eta = 0.01)
+
+
+
+
test function to predict points in a 3D coordinate system lying within the sphere of radius 1 and centre at origin as +1 and others as -1. Note that each point is defined by 3 values but we use 6 features. The function will create random sample points for training and test purposes. The sphere centred at origin and radius 1 is defined as: \(x^2+y^2+z^2=r^2=1\) and if the \(r^2<1\), point lies within the sphere else, outside.
+
Parameters
+
+ [in] eta learning rate (optional, default=0.01)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
298 int range2 = range >> 1;
+
299 for (
int i = 0; i < N; i++) {
+
300 double x0 = ((
std::rand () % range) - range2) / 100.f;
+
301 double x1 = ((
std::rand () % range) - range2) / 100.f;
+
302 double x2 = ((
std::rand () % range) - range2) / 100.f;
+
303 X[i] = {x0, x1, x2, x0 * x0, x1 * x1, x2 * x2};
+
304 Y[i] = ((x0 * x0) + (x1 * x1) + (x2 * x2)) <= 1.f ? 1 : -1;
+
+
+
+
+
+
+
+
+
313 int N_test_cases = 5;
+
314 for (
int i = 0; i < N_test_cases; i++) {
+
315 double x0 = ((
std::rand () % range) - range2) / 100.f;
+
316 double x1 = ((
std::rand () % range) - range2) / 100.f;
+
317 double x2 = ((
std::rand () % range) - range2) / 100.f;
+
+
319 int predict = ada.predict({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});
+
+
321 std::cout <<
"Predict for x=(" << x0 <<
"," << x1 <<
"," << x2
+
+
+
324 int expected_val = ((x0 * x0) + (x1 * x1) + (x2 * x2)) <= 1.f ? 1 : -1;
+
325 assert(predict == expected_val);
+
+
+
+
+
+
+
+
+
+
void test1(double eta=0.01)
Definition: adaline_learning.cpp:202
void test2(double eta=0.01)
Definition: adaline_learning.cpp:236
void test3(double eta=0.01)
Definition: adaline_learning.cpp:287
Definition: adaline_learning.cpp:42
+
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5
new file mode 100644
index 000000000..941f17397
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5
@@ -0,0 +1 @@
+870bd22c77bc2127b72dd097a9637e2e
\ 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
new file mode 100644
index 000000000..e0ad8a8f0
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg
@@ -0,0 +1,286 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node11
+
+std::rand
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg
new file mode 100644
index 000000000..b6a46d97b
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg
@@ -0,0 +1,198 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node11
+
+std::rand
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
new file mode 100644
index 000000000..e2f669efd
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
@@ -0,0 +1,18 @@
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..e458dc7e7
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+d1457a6c2ab59fcbea73ce2ef9e7ac3b
\ 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
new file mode 100644
index 000000000..85752cc52
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,409 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::srand
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+test1
+
+
+
+
+Node1->Node4
+
+
+
+Node13
+
+test2
+
+
+
+
+Node1->Node13
+
+
+
+Node15
+
+test3
+
+
+
+
+Node1->Node15
+
+
+
+Node16
+
+std::time
+
+
+
+
+Node1->Node16
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+machine_learning::adaline::fit
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node5->Node7
+
+
+
+Node5->Node8
+
+
+
+Node6->Node2
+
+
+
+Node6->Node7
+
+
+
+Node8->Node6
+
+
+
+Node9
+
+std::vector::back
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+std::vector::begin
+
+
+
+
+Node8->Node10
+
+
+
+Node11
+
+std::vector::end
+
+
+
+
+Node8->Node11
+
+
+
+Node12
+
+std::inner_product
+
+
+
+
+Node8->Node12
+
+
+
+Node13->Node2
+
+
+
+Node13->Node5
+
+
+
+Node13->Node8
+
+
+
+Node14
+
+std::rand
+
+
+
+
+Node13->Node14
+
+
+
+Node15->Node2
+
+
+
+Node15->Node5
+
+
+
+Node15->Node8
+
+
+
+Node15->Node14
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
new file mode 100644
index 000000000..4cfcc538d
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
@@ -0,0 +1,321 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::srand
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+test1
+
+
+
+
+Node1->Node4
+
+
+
+Node13
+
+test2
+
+
+
+
+Node1->Node13
+
+
+
+Node15
+
+test3
+
+
+
+
+Node1->Node15
+
+
+
+Node16
+
+std::time
+
+
+
+
+Node1->Node16
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+machine_learning::adaline::fit
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node5->Node7
+
+
+
+Node5->Node8
+
+
+
+Node6->Node2
+
+
+
+Node6->Node7
+
+
+
+Node8->Node6
+
+
+
+Node9
+
+std::vector::back
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+std::vector::begin
+
+
+
+
+Node8->Node10
+
+
+
+Node11
+
+std::vector::end
+
+
+
+
+Node8->Node11
+
+
+
+Node12
+
+std::inner_product
+
+
+
+
+Node8->Node12
+
+
+
+Node13->Node2
+
+
+
+Node13->Node5
+
+
+
+Node13->Node8
+
+
+
+Node14
+
+std::rand
+
+
+
+
+Node13->Node14
+
+
+
+Node15->Node2
+
+
+
+Node15->Node5
+
+
+
+Node15->Node8
+
+
+
+Node15->Node14
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map
new file mode 100644
index 000000000..36b9c80fa
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map
@@ -0,0 +1,12 @@
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5
new file mode 100644
index 000000000..d1eb81bf0
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5
@@ -0,0 +1 @@
+75b4ea7b8a6baaa087a653221e9b3676
\ 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
new file mode 100644
index 000000000..6a5fd561c
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg
@@ -0,0 +1,271 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg
new file mode 100644
index 000000000..20bb168c4
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg
@@ -0,0 +1,183 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map
new file mode 100644
index 000000000..75584488c
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5
new file mode 100644
index 000000000..f0a16af9d
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5
@@ -0,0 +1 @@
+f99ca4112f36532975fad1fb18a1867f
\ 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
new file mode 100644
index 000000000..b608d4cbb
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg
@@ -0,0 +1,286 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node11
+
+std::rand
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg
new file mode 100644
index 000000000..2a70b6c52
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg
@@ -0,0 +1,198 @@
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::adaline::fit
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node6
+
+
+
+Node11
+
+std::rand
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node3->Node5
+
+
+
+Node3->Node6
+
+
+
+Node4->Node2
+
+
+
+Node4->Node5
+
+
+
+Node6->Node4
+
+
+
+Node7
+
+std::vector::back
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::vector::begin
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::vector::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::inner_product
+
+
+
+
+Node6->Node10
+
+
+
diff --git a/d5/dc2/structlca-members.html b/d5/dc2/structlca-members.html
new file mode 100644
index 000000000..e8f0616a7
--- /dev/null
+++ b/d5/dc2/structlca-members.html
@@ -0,0 +1,120 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for lca , including all inherited members.
+
+ adj (defined in lca )lca build () (defined in lca )lca inline dfs (int node, int par) (defined in lca )lca inline lca (int n_) (defined in lca )lca inline level (defined in lca )lca n (defined in lca )lca query (int u, int v) (defined in lca )lca inline up (defined in lca )lca verify () (defined in lca )lca inline
+
+
diff --git a/d5/dca/vector__important__functions_8cpp__incl.md5 b/d5/dca/vector__important__functions_8cpp__incl.md5
new file mode 100644
index 000000000..5cb3d86f5
--- /dev/null
+++ b/d5/dca/vector__important__functions_8cpp__incl.md5
@@ -0,0 +1 @@
+1a36f892a12a3814bd6e00b0a3cb3fbb
\ No newline at end of file
diff --git a/d5/dca/vector__important__functions_8cpp__incl.svg b/d5/dca/vector__important__functions_8cpp__incl.svg
new file mode 100644
index 000000000..6430a9724
--- /dev/null
+++ b/d5/dca/vector__important__functions_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+others/vector_important_functions.cpp
+
+Node1
+
+others/vector_important
+_functions.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+numeric
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.map b/d5/dcd/kohonen__som__topology_8cpp__incl.map
new file mode 100644
index 000000000..484f33a8b
--- /dev/null
+++ b/d5/dcd/kohonen__som__topology_8cpp__incl.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.md5 b/d5/dcd/kohonen__som__topology_8cpp__incl.md5
new file mode 100644
index 000000000..9f72bd49d
--- /dev/null
+++ b/d5/dcd/kohonen__som__topology_8cpp__incl.md5
@@ -0,0 +1 @@
+67a3c667ee0103bb03c5d5c8cdf3b1e5
\ No newline at end of file
diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.svg b/d5/dcd/kohonen__som__topology_8cpp__incl.svg
new file mode 100644
index 000000000..a416991a4
--- /dev/null
+++ b/d5/dcd/kohonen__som__topology_8cpp__incl.svg
@@ -0,0 +1,231 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning/kohonen_som_topology.cpp
+
+Node1
+
+machine_learning/kohonen
+_som_topology.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+fstream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+valarray
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg
new file mode 100644
index 000000000..99ef94113
--- /dev/null
+++ b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+machine_learning/kohonen_som_topology.cpp
+
+Node1
+
+machine_learning/kohonen
+_som_topology.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdlib
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+ctime
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+fstream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+valarray
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
diff --git a/d5/ddf/struct_btree-members.html b/d5/ddf/struct_btree-members.html
new file mode 100644
index 000000000..2734080bd
--- /dev/null
+++ b/d5/ddf/struct_btree-members.html
@@ -0,0 +1,114 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Btree , including all inherited members.
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for tower , including all inherited members.
+
+
Algorithms_in_C++: others/stairs_pattern.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This program is use to print the following pattern.
+More...
+
#include <iostream>
+
+
This program is use to print the following pattern.
+
+ \*\*
+ \*\*
+ \*\*\*\*
+ \*\*\*\*
+ \*\*\*\*\*\*
+ \*\*\*\*\*\*
+\*\*\*\*\*\*\*\*
+ where number of pairs line is given by user
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
18 int l, st = 2, x, r, z, n, sp;
+
+
+
+
22 for (r = 1; r <= x; r++) {
+
+
24 for (n = 1; n <= 2; n++) {
+
25 for (sp = 1; sp <= z; sp++) {
+
+
+
28 for (l = 1; l <= st; l++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..86a68ba5f
--- /dev/null
+++ b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+7b66b13cd9e906646a781de5e20f13d9
\ 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
new file mode 100644
index 000000000..01ecc6aea
--- /dev/null
+++ b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/d1d/bubble__sort_8cpp__incl.map b/d6/d1d/bubble__sort_8cpp__incl.map
new file mode 100644
index 000000000..ac3f1fb38
--- /dev/null
+++ b/d6/d1d/bubble__sort_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/d1d/bubble__sort_8cpp__incl.md5 b/d6/d1d/bubble__sort_8cpp__incl.md5
new file mode 100644
index 000000000..5f765f3d2
--- /dev/null
+++ b/d6/d1d/bubble__sort_8cpp__incl.md5
@@ -0,0 +1 @@
+46c7b538076e2baa5479f627961925d9
\ No newline at end of file
diff --git a/d6/d1d/bubble__sort_8cpp__incl.svg b/d6/d1d/bubble__sort_8cpp__incl.svg
new file mode 100644
index 000000000..afefb3323
--- /dev/null
+++ b/d6/d1d/bubble__sort_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+sorting/bubble_sort.cpp
+
+Node1
+
+sorting/bubble_sort.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html
new file mode 100644
index 000000000..df7489d9b
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline.html
@@ -0,0 +1,558 @@
+
+
+
+Algorithms_in_C++: machine_learning::adaline Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ adaline (int num_features, const double eta =0.01f , const double accuracy =1e-5) int predict (const std::vector < double > &x, double *out=nullptr) double fit (const std::vector < double > &x, const int &y) template<int N> void fit (std::vector < double > const (&X)[N], const int *y) activation (double x)
+eta learning rate of the algorithm accuracy model fit convergence accuracy std::vector < double > weights weights of the neural network
+
+
+
◆
+
+
+
+
+
+
+
+
+ machine_learning::adaline::adaline
+ (
+ int
+ num_features ,
+
+ const double
+ eta = 0.01f ,
+
+ const double
+ accuracy = 1e-5
+
+ )
+
+
+
+
+inline
+
+
+
+
Default constructor
Parameters
+
+ [in] num_features number of features present [in] eta learning rate (optional, default=0.1) [in] convergence accuracy (optional, default= \(1\times10^{-5}\))
+
+
+
+
+
55 std::cerr <<
"learning rate should be positive and nonzero"
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ bool machine_learning::adaline::check_size_match
+ (
+ const std::vector < double > &
+ x )
+
+
+
+
+inline private
+
+
+
+
convenient function to check if input feature vector size matches the model weights size
Parameters
+
+ [in] x fecture vector to check
+
+
+
Returns true size matches
+false size does not match
+
+
+
+
177 <<
"Number of features in x does not match the feature "
+
178 "dimension in model!"
+
+
+
+
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
+
+
+
+
+ double machine_learning::adaline::fit
+ (
+ const std::vector < double > &
+ x ,
+
+ const int &
+ y
+
+ )
+
+
+
+
+inline
+
+
+
+
Update the weights of the model using supervised learning for one feature vector
Parameters
+
+ [in] x feature vector [in] y known output value
+
+
+
Returns correction factor
+
+
+
+
+
+
+
116 int prediction_error = y - p;
+
117 double correction_factor =
eta * prediction_error;
+
+
+
120 for (
int i = 0; i < x.
size (); i++) {
+
121 weights [i] += correction_factor * x[i];
+
+
+
+
125 return correction_factor;
+
+
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
+template<int N>
+
+
+
+
+
+ void machine_learning::adaline::fit
+ (
+ std::vector < double > const (&) X [N],
+
+ const int *
+ y
+
+ )
+
+
+
+
+inline
+
+
+
+
Update the weights of the model using supervised learning for an array of vectors.
Parameters
+
+ [in] X array of feature vector [in] y known output value for each feature vector
+
+
+
+
135 double avg_pred_error = 1.f;
+
+
+
138 for (iter = 0; (iter < MAX_ITER) && (avg_pred_error >
accuracy );
+
+
140 avg_pred_error = 0.f;
+
+
+
143 for (
int i = 0; i < N; i++) {
+
144 double err =
fit (X[i], y[i]);
+
145 avg_pred_error += std::abs(err);
+
+
+
+
+
+
151 std::cout <<
"\tIter " << iter <<
": Training weights: " << *
this
+
152 <<
"\tAvg error: " << avg_pred_error <<
std::endl ;
+
+
+
+
+
157 std::cout <<
"Converged after " << iter <<
" iterations."
+
+
+
160 std::cout <<
"Did not converge after " << iter <<
" iterations."
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ int machine_learning::adaline::predict
+ (
+ const std::vector < double > &
+ x ,
+
+ double *
+ out = nullptr
+
+ )
+
+
+
+
+inline
+
+
+
+
predict the output of the model for given set of features
Parameters
+
+ [in] x input vector [out] out optional argument to return neuron output before applying activation function (optional, nullptr to ignore)
+
+
+
Returns model prediction output
+
+
+
+
+
+
+
+
+
+
+
+
+
102 return activation(y);
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Operator to print the weights of the model
+
+
+
+
The documentation for this class was generated from the following file:
+
+
T inner_product(T... args)
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:110
int predict(const std::vector< double > &x, double *out=nullptr)
Definition: adaline_learning.cpp:90
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:174
const double eta
learning rate of the algorithm
Definition: adaline_learning.cpp:185
std::vector< double > weights
weights of the neural network
Definition: adaline_learning.cpp:187
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:186
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5
new file mode 100644
index 000000000..fb7a85a56
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5
@@ -0,0 +1 @@
+48ac07b4b534689340efb3657b248b78
\ 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
new file mode 100644
index 000000000..ac0e14de0
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+machine_learning::adaline::adaline
+
+Node1
+
+machine_learning::adaline
+::adaline
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exit
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map
new file mode 100644
index 000000000..4b82e5b85
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5
new file mode 100644
index 000000000..254889b5c
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5
@@ -0,0 +1 @@
+6eb9bb42f542e5e4e0d91d2673f3e103
\ 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
new file mode 100644
index 000000000..ce7b9ceab
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg
@@ -0,0 +1,244 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning::adaline::fit
+
+Node1
+
+machine_learning::adaline::fit
+
+
+
+
+Node2
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node5
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node2->Node4
+
+
+
+Node5->Node2
+
+
+
+Node6
+
+std::vector::back
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::begin
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+std::vector::end
+
+
+
+
+Node5->Node8
+
+
+
+Node9
+
+std::inner_product
+
+
+
+
+Node5->Node9
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg
new file mode 100644
index 000000000..fd9f320ec
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg
@@ -0,0 +1,156 @@
+
+
+
+
+
+
+machine_learning::adaline::fit
+
+Node1
+
+machine_learning::adaline::fit
+
+
+
+
+Node2
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node1->Node5
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node2->Node4
+
+
+
+Node5->Node2
+
+
+
+Node6
+
+std::vector::back
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::begin
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+std::vector::end
+
+
+
+
+Node5->Node8
+
+
+
+Node9
+
+std::inner_product
+
+
+
+
+Node5->Node9
+
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map
new file mode 100644
index 000000000..5a91d4c79
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5
new file mode 100644
index 000000000..6b6a18c93
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5
@@ -0,0 +1 @@
+8db2fedc269fc8cbc0b217f6f0c65b67
\ 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
new file mode 100644
index 000000000..2c27d70b0
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg
@@ -0,0 +1,129 @@
+
+
+
+
+
+
+machine_learning::adaline::predict
+
+Node1
+
+machine_learning::adaline
+::predict
+
+
+
+
+Node2
+
+std::vector::back
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::begin
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node1->Node4
+
+
+
+Node7
+
+std::vector::end
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::inner_product
+
+
+
+
+Node1->Node8
+
+
+
+Node5
+
+std::endl
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::vector::size
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map
new file mode 100644
index 000000000..aa183e7f0
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5
new file mode 100644
index 000000000..8a44e40e6
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5
@@ -0,0 +1 @@
+6446f3f1dd1fd9a11b5e0e220cdbaffc
\ 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
new file mode 100644
index 000000000..68b77b9ab
--- /dev/null
+++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+machine_learning::adaline::check_size_match
+
+Node1
+
+machine_learning::adaline
+::check_size_match
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/d38/newton__raphson__method_8cpp__incl.map b/d6/d38/newton__raphson__method_8cpp__incl.map
new file mode 100644
index 000000000..5e1261548
--- /dev/null
+++ b/d6/d38/newton__raphson__method_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d6/d38/newton__raphson__method_8cpp__incl.md5 b/d6/d38/newton__raphson__method_8cpp__incl.md5
new file mode 100644
index 000000000..531735aea
--- /dev/null
+++ b/d6/d38/newton__raphson__method_8cpp__incl.md5
@@ -0,0 +1 @@
+b9a31984a7cfea3d2f70ff187a3eb6b1
\ No newline at end of file
diff --git a/d6/d38/newton__raphson__method_8cpp__incl.svg b/d6/d38/newton__raphson__method_8cpp__incl.svg
new file mode 100644
index 000000000..105f1eab1
--- /dev/null
+++ b/d6/d38/newton__raphson__method_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+numerical_methods/newton_raphson_method.cpp
+
+Node1
+
+numerical_methods/newton
+_raphson_method.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+limits
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d6/d48/structtrie-members.html b/d6/d48/structtrie-members.html
new file mode 100644
index 000000000..e49fdf24c
--- /dev/null
+++ b/d6/d48/structtrie-members.html
@@ -0,0 +1,113 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for trie , including all inherited members.
+
+
Algorithms_in_C++: probability/addition_rule.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Addition rule of probabilities.
+More...
+
#include <iostream>
+
+
Addition rule of probabilities.
+
+
+
◆
+
+
+
+
+
+ double addition_rule_dependent
+ (
+ double
+ A ,
+
+ double
+ B ,
+
+ double
+ B_given_A
+
+ )
+
+
+
+
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
Returns probability of A and B
+
+
26 return (A + B) - (A * B_given_A);
+
+
+
+
+
+
◆
+
+
+
+
+
+ double addition_rule_independent
+ (
+ double
+ A ,
+
+ double
+ B
+
+ )
+
+
+
+
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
Returns probability of A and B
+
+
15 return (A + B) - (A * B);
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
33 double B_given_A = 0.05;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
double addition_rule_dependent(double A, double B, double B_given_A)
Definition: addition_rule.cpp:25
double addition_rule_independent(double A, double B)
Definition: addition_rule.cpp:14
+
diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..abb5cdfd8
--- /dev/null
+++ b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+70fde2597a9c89ac7fce0429aae12473
\ 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
new file mode 100644
index 000000000..065805981
--- /dev/null
+++ b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+addition_rule_dependent
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+addition_rule_independent
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map
new file mode 100644
index 000000000..81db51b57
--- /dev/null
+++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5
new file mode 100644
index 000000000..870f57181
--- /dev/null
+++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5
@@ -0,0 +1 @@
+3143fa2df861ad609e353175d5bd4fe3
\ No newline at end of file
diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg
new file mode 100644
index 000000000..54e25f0f6
--- /dev/null
+++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+math/gcd_recursive_euclidean.cpp
+
+Node1
+
+math/gcd_recursive
+_euclidean.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/d60/group__ode.html b/d6/d60/group__ode.html
new file mode 100644
index 000000000..391e8575f
--- /dev/null
+++ b/d6/d60/group__ode.html
@@ -0,0 +1,659 @@
+
+
+
+Algorithms_in_C++: Ordinary Differential Equations
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+void forward_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the forward-Euler method. More... double forward_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the forward-Euler method in the given limits. More... void midpoint_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the midpoint-Euler method. More... double midpoint_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the midpoint-Euler method in the given limits. More... void semi_implicit_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the semi-implicit-Euler method. More... double semi_implicit_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the semi-implicit-Euler method in the given limits. More...
+
+
Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.
+
+
+
◆
+
+
+
+
+
+ double forward_euler
+ (
+ double
+ dx ,
+
+ double
+ x0 ,
+
+ double
+ x_max ,
+
+ std::valarray < double > * y ,
+
+ bool
+ save_to_file = false
+
+ )
+
+
+
+
+
Compute approximation using the forward-Euler method in the given limits.
+
Parameters
+
+ [in] dx step size [in] x0 initial value of independent variable [in] x_max final value of independent variable [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in] save_to_file flag to save results to a CSV file (1) or not (0)
+
+
+
Returns time taken for computation in seconds
+
+
+
+
+
+
108 fp.
open (
"forward_euler.csv" , std::ofstream::out);
+
+
+
+
+
+
+
+
+
+
+
+
+
121 if (save_to_file && fp.
is_open ()) {
+
+
+
124 for (
int i = 0; i < L - 1; i++) {
+
125 fp << y[0][i] <<
"," ;
+
+
127 fp << y[0][L - 1] <<
"\n" ;
+
+
+
+
+
132 }
while (x <= x_max);
+
+
+
+
+
+
+
139 return static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void forward_euler_step
+ (
+ const double
+ dx ,
+
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Compute next step approximation using the forward-Euler method.
+
+\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\]
+
+
Parameters
+
+ [in] dx step size [in] x take \(x_n\) and compute \(x_{n+1}\) [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in,out] dy compute \(f\left(x_n,y_n\right)\)
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double midpoint_euler
+ (
+ double
+ dx ,
+
+ double
+ x0 ,
+
+ double
+ x_max ,
+
+ std::valarray < double > * y ,
+
+ bool
+ save_to_file = false
+
+ )
+
+
+
+
+
Compute approximation using the midpoint-Euler method in the given limits.
+
Parameters
+
+ [in] dx step size [in] x0 initial value of independent variable [in] x_max final value of independent variable [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in] save_to_file flag to save results to a CSV file (1) or not (0)
+
+
+
Returns time taken for computation in seconds
+
+
+
+
+
+
113 fp.
open (
"midpoint_euler.csv" , std::ofstream::out);
+
+
+
+
+
+
+
+
+
+
+
+
125 if (save_to_file && fp.
is_open ()) {
+
+
+
128 for (
int i = 0; i < L - 1; i++) {
+
129 fp << y[0][i] <<
"," ;
+
+
131 fp << y[0][L - 1] <<
"\n" ;
+
+
+
+
+
136 }
while (x <= x_max);
+
+
+
+
+
+
+
143 return static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void midpoint_euler_step
+ (
+ const double
+ dx ,
+
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Compute next step approximation using the midpoint-Euler method.
+
+\[y_{n+1} = y_n + dx\, f\left(x_n+\frac{1}{2}dx, y_n + \frac{1}{2}dx\,f\left(x_n,y_n\right)\right)\]
+
+
Parameters
+
+ [in] dx step size [in] x take \(x_n\) and compute \(x_{n+1}\) [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in,out] dy compute \(f\left(x_n,y_n\right)\)
+
+
+
+
+
88 double tmp_x = x + 0.5 * dx;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double semi_implicit_euler
+ (
+ double
+ dx ,
+
+ double
+ x0 ,
+
+ double
+ x_max ,
+
+ std::valarray < double > * y ,
+
+ bool
+ save_to_file = false
+
+ )
+
+
+
+
+
Compute approximation using the semi-implicit-Euler method in the given limits.
+
Parameters
+
+ [in] dx step size [in] x0 initial value of independent variable [in] x_max final value of independent variable [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in] save_to_file flag to save results to a CSV file (1) or not (0)
+
+
+
Returns time taken for computation in seconds
+
+
+
+
+
+
110 fp.
open (
"semi_implicit_euler.csv" , std::ofstream::out);
+
+
+
+
+
+
+
+
+
+
+
+
122 if (save_to_file && fp.
is_open ()) {
+
+
+
125 for (
int i = 0; i < L - 1; i++) {
+
126 fp << y[0][i] <<
"," ;
+
+
128 fp << y[0][L - 1] <<
"\n" ;
+
+
+
+
+
133 }
while (x <= x_max);
+
+
+
+
+
+
+
140 return static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void semi_implicit_euler_step
+ (
+ const double
+ dx ,
+
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Compute next step approximation using the semi-implicit-Euler method.
+
+\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\]
+
+
Parameters
+
+ [in] dx step size [in] x take \(x_n\) and compute \(x_{n+1}\) [in,out] y take \(y_n\) and compute \(y_{n+1}\) [in,out] dy compute \(f\left(x_n,y_n\right)\)
+
+
+
+
+
86 y[0][0] += dx * dy[0][0];
+
+
+
+
+
+
+
+
+
+
+
+
void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the semi-implicit-Euler method.
Definition: ode_semi_implicit_euler.cpp:82
void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the midpoint-Euler method.
Definition: ode_midpoint_euler.cpp:85
void forward_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the forward-Euler method.
Definition: ode_forward_euler.cpp:86
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_semi_implicit_euler.cpp:53
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_forward_euler.cpp:54
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_midpoint_euler.cpp:53
+
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5
new file mode 100644
index 000000000..6e22ec1f4
--- /dev/null
+++ b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5
@@ -0,0 +1 @@
+a248f6012e474f29ac195e140a8405e9
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg
new file mode 100644
index 000000000..b3de4f4ac
--- /dev/null
+++ b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+midpoint_euler
+
+Node1
+
+midpoint_euler
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+midpoint_euler_step
+
+
+
+
+Node1->Node5
+
+
+
+Node7
+
+std::ofstream::open
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::perror
+
+
+
+
+Node1->Node8
+
+
+
+Node6
+
+problem
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map
new file mode 100644
index 000000000..37cff0395
--- /dev/null
+++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5
new file mode 100644
index 000000000..86cbff09a
--- /dev/null
+++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5
@@ -0,0 +1 @@
+c8b8ed3819f3d5229448adab5a475143
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg
new file mode 100644
index 000000000..3533609a6
--- /dev/null
+++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+semi_implicit_euler
+
+Node1
+
+semi_implicit_euler
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::ofstream::open
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::perror
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+semi_implicit_euler_step
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+problem
+
+
+
+
+Node7->Node8
+
+
+
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map
new file mode 100644
index 000000000..881a7d493
--- /dev/null
+++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5
new file mode 100644
index 000000000..2b4d4cef5
--- /dev/null
+++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5
@@ -0,0 +1 @@
+a153ca0757d2bcac00fb6a95102a1cad
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg
new file mode 100644
index 000000000..ca857e17c
--- /dev/null
+++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+semi_implicit_euler_step
+
+Node1
+
+semi_implicit_euler_step
+
+
+
+
+Node2
+
+problem
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map
new file mode 100644
index 000000000..52add241d
--- /dev/null
+++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5
new file mode 100644
index 000000000..cc2d0da2b
--- /dev/null
+++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5
@@ -0,0 +1 @@
+52c5de426248663ee449e4e163707034
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg
new file mode 100644
index 000000000..9e2e57425
--- /dev/null
+++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+midpoint_euler_step
+
+Node1
+
+midpoint_euler_step
+
+
+
+
+Node2
+
+problem
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map
new file mode 100644
index 000000000..8afd162d8
--- /dev/null
+++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5
new file mode 100644
index 000000000..b580420dc
--- /dev/null
+++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5
@@ -0,0 +1 @@
+cc0ffdf7d4a5a24834d33f3aff44f5e5
\ No newline at end of file
diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg
new file mode 100644
index 000000000..2b21d0643
--- /dev/null
+++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+forward_euler_step
+
+Node1
+
+forward_euler_step
+
+
+
+
+Node2
+
+problem
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map
new file mode 100644
index 000000000..122fee8d5
--- /dev/null
+++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5
new file mode 100644
index 000000000..7c2d1ef3c
--- /dev/null
+++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5
@@ -0,0 +1 @@
+ec156c3bc23a477627ca84fc592670e4
\ No newline at end of file
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg
new file mode 100644
index 000000000..e5b715b8a
--- /dev/null
+++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+forward_euler
+
+Node1
+
+forward_euler
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+forward_euler_step
+
+
+
+
+Node1->Node4
+
+
+
+Node6
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::ofstream::open
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::perror
+
+
+
+
+Node1->Node8
+
+
+
+Node5
+
+problem
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/d6/d93/large__number_8h__dep__incl.map b/d6/d93/large__number_8h__dep__incl.map
new file mode 100644
index 000000000..6d8002ecf
--- /dev/null
+++ b/d6/d93/large__number_8h__dep__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/d93/large__number_8h__dep__incl.md5 b/d6/d93/large__number_8h__dep__incl.md5
new file mode 100644
index 000000000..3a4462d67
--- /dev/null
+++ b/d6/d93/large__number_8h__dep__incl.md5
@@ -0,0 +1 @@
+dcd60cfec5046d70ce2d9c7b127f62e7
\ No newline at end of file
diff --git a/d6/d93/large__number_8h__dep__incl.svg b/d6/d93/large__number_8h__dep__incl.svg
new file mode 100644
index 000000000..6575c4f1d
--- /dev/null
+++ b/d6/d93/large__number_8h__dep__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/large_number.h
+
+Node1
+
+math/large_number.h
+
+
+
+
+Node2
+
+math/fibonacci_large.cpp
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+math/large_factorial.cpp
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html
new file mode 100644
index 000000000..e77463312
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp.html
@@ -0,0 +1,328 @@
+
+
+
+Algorithms_in_C++: math/large_factorial.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute factorial of any arbitratily large number/.
+More...
+
#include <cstring>
+
#include <ctime>
+
#include <iostream>
+
#include "./large_number.h "
+
+bool test1 () bool test2 () int main (int argc, char *argv[])
+
+
Compute factorial of any arbitratily large number/.
+
Author Krishna Vedala
+
See also factorial.cpp
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
Main program
+
+
+
+
+
93 number =
atoi (argv[1]);
+
+
95 std::cout <<
"Enter the value of n(n starts from 0 ): " ;
+
+
+
+
+
+
+
102 for (i = 2; i <= number; i++)
+
+
+
+
106 static_cast< double > (end_time - start_time) / CLOCKS_PER_SEC;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool test1
+ (
+ )
+
+
+
+
Test implementation for 10! Result must be 3628800.
Returns True if test pass else False
+
+
+
19 unsigned int i, number = 10;
+
+
21 for (i = 2; i <= number; i++)
+
+
+
24 const char *known_reslt =
"3628800" ;
+
+
+
+
+
+
+
+
+
+
34 for (i = 0; i < N; i++) {
+
+
36 std::cerr << i <<
"^th digit mismatch! " << known_reslt[i]
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool test2
+ (
+ )
+
+
+
+
Test implementation for 100! The result is the 156 digit number:
9332621544394415268169923885626670049071596826438162146859296389521759
+
9993229915608941463976156518286253697920827223758251185210916864000000
+
000000000000000000
+
Returns True if test pass else False
+
+
+
56 unsigned int i, number = 100;
+
+
58 for (i = 2; i <= number; i++)
+
+
+
61 const char *known_reslt =
+
62 "9332621544394415268169923885626670049071596826438162146859296389521759"
+
63 "9993229915608941463976156518286253697920827223758251185210916864000000"
+
+
+
+
+
+
+
+
+
+
+
74 for (i = 0; i < N; i++) {
+
+
76 std::cerr << i <<
"^th digit mismatch! " << known_reslt[i]
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
bool test1()
Definition: large_factorial.cpp:17
Definition: large_number.h:24
const char digit_char(size_t i) const
Definition: large_number.h:248
const size_t num_digits() const
Definition: large_number.h:130
bool test2()
Definition: large_factorial.cpp:54
static bool test()
Definition: large_number.h:65
+
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..80f066ff3
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+429968bbb93801a3d9a43513416807e5
\ 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
new file mode 100644
index 000000000..39dcfc561
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,318 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+large_number::num_digits
+
+
+
+
+Node1->Node4
+
+
+
+Node6
+
+std::scientific
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+large_number::test
+
+
+
+
+Node1->Node7
+
+
+
+Node10
+
+test1
+
+
+
+
+Node1->Node10
+
+
+
+Node12
+
+test2
+
+
+
+
+Node1->Node12
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node4->Node5
+
+
+
+Node7->Node3
+
+
+
+Node8
+
+large_number::large
+_number
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node8->Node9
+
+
+
+Node10->Node3
+
+
+
+Node10->Node4
+
+
+
+Node11
+
+large_number::digit_char
+
+
+
+
+Node10->Node11
+
+
+
+Node11->Node4
+
+
+
+Node12->Node3
+
+
+
+Node12->Node4
+
+
+
+Node12->Node11
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..6ab613552
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,230 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+large_number::num_digits
+
+
+
+
+Node1->Node4
+
+
+
+Node6
+
+std::scientific
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+large_number::test
+
+
+
+
+Node1->Node7
+
+
+
+Node10
+
+test1
+
+
+
+
+Node1->Node10
+
+
+
+Node12
+
+test2
+
+
+
+
+Node1->Node12
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node4->Node5
+
+
+
+Node7->Node3
+
+
+
+Node8
+
+large_number::large
+_number
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::vector::push_back
+
+
+
+
+Node8->Node9
+
+
+
+Node10->Node3
+
+
+
+Node10->Node4
+
+
+
+Node11
+
+large_number::digit_char
+
+
+
+
+Node10->Node11
+
+
+
+Node11->Node4
+
+
+
+Node12->Node3
+
+
+
+Node12->Node4
+
+
+
+Node12->Node11
+
+
+
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map
new file mode 100644
index 000000000..c570ae9c6
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5
new file mode 100644
index 000000000..66098fec5
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5
@@ -0,0 +1 @@
+291b8e868fe6c68650d9a09586069020
\ 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
new file mode 100644
index 000000000..0e0c576fe
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg
@@ -0,0 +1,88 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+large_number::digit_char
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+large_number::num_digits
+
+
+
+
+Node1->Node3
+
+
+
+Node5
+
+std::endl
+
+
+
+
+Node1->Node5
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map
new file mode 100644
index 000000000..a5a98fb45
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5
new file mode 100644
index 000000000..295d1025e
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5
@@ -0,0 +1 @@
+5ad0332dba2cbed8d628f757cc670c56
\ 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
new file mode 100644
index 000000000..05bc5b4c6
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg
@@ -0,0 +1,88 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+large_number::digit_char
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+large_number::num_digits
+
+
+
+
+Node1->Node3
+
+
+
+Node5
+
+std::endl
+
+
+
+
+Node1->Node5
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/d6/db0/binomial__dist_8cpp.html b/d6/db0/binomial__dist_8cpp.html
new file mode 100644
index 000000000..fada93b99
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp.html
@@ -0,0 +1,468 @@
+
+
+
+Algorithms_in_C++: probability/binomial_dist.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Binomial distribution example
+More...
+
#include <cmath>#include <iostream>
+
+
Binomial distribution example
+
The binomial distribution models the number of successes in a sequence of n independent events
+
Summary of variables used:
+n : number of trials
+p : probability of success
+x : desired successes
+
+
+
+
◆
+
+
+
+
+
+ double binomial_expected
+ (
+ double
+ n ,
+
+ double
+ p
+
+ )
+
+
+
+
finds the expected value of a binomial distribution
Parameters
+
+
+
+
Returns \(\mu=np\)
+
+
+
+
+
◆
+
+
+
+
+
+ double binomial_range_successes
+ (
+ double
+ n ,
+
+ double
+ p ,
+
+ double
+ lower_bound ,
+
+ double
+ upper_bound
+
+ )
+
+
+
+
calculates the probability of a result within a range (inclusive, inclusive)
Returns \(\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}\)
+
+
76 double probability = 0;
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double binomial_standard_deviation
+ (
+ double
+ n ,
+
+ double
+ p
+
+ )
+
+
+
+
finds the standard deviation of the binomial distribution
Parameters
+
+
+
+
Returns \(\sigma = \sqrt{\sigma^2} = \sqrt{n\cdot p\cdot (1-p)}\)
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double binomial_variance
+ (
+ double
+ n ,
+
+ double
+ p
+
+ )
+
+
+
+
finds the variance of the binomial distribution
Parameters
+
+
+
+
Returns \(\sigma^2 = n\cdot p\cdot (1-p)\)
+
29 {
return n * p * (1 - p); }
+
+
+
+
+
◆
+
+
+
+
+
+ double binomial_x_successes
+ (
+ double
+ n ,
+
+ double
+ p ,
+
+ double
+ x
+
+ )
+
+
+
+
calculates the probability of exactly x successes
Returns \(\displaystyle P(n,p,x) = {n\choose x} p^x (1-p)^{n-x}\)
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double nCr
+ (
+ double
+ n ,
+
+ double
+ r
+
+ )
+
+
+
+
Computes n choose r
Parameters
+
+
+
+
Returns \(\displaystyle {n\choose r} = \frac{n!}{r!(n-r)!} = \frac{n\times(n-1)\times(n-2)\times\cdots(n-r)}{r!} \)
+
+
+
49 double denominator = r;
+
+
51 for (
int i = n - 1; i >= ((n - r) + 1); i--) {
+
+
+
+
55 for (
int i = 1; i < r; i++) {
+
+
+
+
59 return numerator / denominator;
+
+
+
+
+
+
double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
Definition: binomial_dist.cpp:74
double binomial_standard_deviation(double n, double p)
Definition: binomial_dist.cpp:36
double binomial_x_successes(double n, double p, double x)
Definition: binomial_dist.cpp:65
double binomial_expected(double n, double p)
Definition: binomial_dist.cpp:22
double nCr(double n, double r)
Definition: binomial_dist.cpp:47
double binomial_variance(double n, double p)
Definition: binomial_dist.cpp:29
+
diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5
new file mode 100644
index 000000000..4641dc853
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5
@@ -0,0 +1 @@
+e0cc18349496dd50d202156c80b67c0f
\ 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
new file mode 100644
index 000000000..c948a6676
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+binomial_x_successes
+
+Node1
+
+binomial_x_successes
+
+
+
+
+Node2
+
+nCr
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::pow
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map
new file mode 100644
index 000000000..15be69911
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5
new file mode 100644
index 000000000..868021649
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5
@@ -0,0 +1 @@
+dabea74f3b6141980067c46e44533798
\ 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
new file mode 100644
index 000000000..2a5127e60
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+binomial_range_successes
+
+Node1
+
+binomial_range_successes
+
+
+
+
+Node2
+
+nCr
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::pow
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..3d18f78b8
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,12 @@
+
+
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..769e6d02b
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+241176135fb2f4772775a627fcb843ed
\ 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
new file mode 100644
index 000000000..23d63426d
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,175 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+binomial_expected
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+binomial_range_successes
+
+
+
+
+Node1->Node3
+
+
+
+Node6
+
+binomial_standard_deviation
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+binomial_variance
+
+
+
+
+Node1->Node7
+
+
+
+Node9
+
+binomial_x_successes
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+std::endl
+
+
+
+
+Node1->Node10
+
+
+
+Node4
+
+nCr
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::pow
+
+
+
+
+Node3->Node5
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node6->Node8
+
+
+
+Node9->Node4
+
+
+
+Node9->Node5
+
+
+
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map
new file mode 100644
index 000000000..dd635b2df
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5
new file mode 100644
index 000000000..0849edb5c
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5
@@ -0,0 +1 @@
+55746bfa32fb1b0920a0b917aa81b1a4
\ 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
new file mode 100644
index 000000000..6734af72f
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+binomial_standard_deviation
+
+Node1
+
+binomial_standard_deviation
+
+
+
+
+Node2
+
+binomial_variance
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sqrt
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.map b/d6/db4/ode__semi__implicit__euler_8cpp__incl.map
new file mode 100644
index 000000000..d6187b2c4
--- /dev/null
+++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.map
@@ -0,0 +1,8 @@
+
+
diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 b/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5
new file mode 100644
index 000000000..7d87b95c5
--- /dev/null
+++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5
@@ -0,0 +1 @@
+0f917f6af8ca086e4a9ebac5f2c84f7c
\ No newline at end of file
diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg
new file mode 100644
index 000000000..56e2f68cd
--- /dev/null
+++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+numerical_methods/ode_semi_implicit_euler.cpp
+
+Node1
+
+numerical_methods/ode
+_semi_implicit_euler.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+fstream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+valarray
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/d6/dbc/sparse__matrix_8cpp__incl.map b/d6/dbc/sparse__matrix_8cpp__incl.map
new file mode 100644
index 000000000..dbc8d961e
--- /dev/null
+++ b/d6/dbc/sparse__matrix_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/dbc/sparse__matrix_8cpp__incl.md5 b/d6/dbc/sparse__matrix_8cpp__incl.md5
new file mode 100644
index 000000000..46c1fd3ac
--- /dev/null
+++ b/d6/dbc/sparse__matrix_8cpp__incl.md5
@@ -0,0 +1 @@
+a697780e187885f80c0ad3662deb53cd
\ No newline at end of file
diff --git a/d6/dbc/sparse__matrix_8cpp__incl.svg b/d6/dbc/sparse__matrix_8cpp__incl.svg
new file mode 100644
index 000000000..a1d8d9d4f
--- /dev/null
+++ b/d6/dbc/sparse__matrix_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/sparse_matrix.cpp
+
+Node1
+
+others/sparse_matrix.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d6/dbd/jump__search_8cpp__incl.map b/d6/dbd/jump__search_8cpp__incl.map
new file mode 100644
index 000000000..eff4eb05e
--- /dev/null
+++ b/d6/dbd/jump__search_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d6/dbd/jump__search_8cpp__incl.md5 b/d6/dbd/jump__search_8cpp__incl.md5
new file mode 100644
index 000000000..eed675e5a
--- /dev/null
+++ b/d6/dbd/jump__search_8cpp__incl.md5
@@ -0,0 +1 @@
+dde2efbf90aec32b749f0d88400e8ee1
\ No newline at end of file
diff --git a/d6/dbd/jump__search_8cpp__incl.svg b/d6/dbd/jump__search_8cpp__incl.svg
new file mode 100644
index 000000000..6af372952
--- /dev/null
+++ b/d6/dbd/jump__search_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+search/jump_search.cpp
+
+Node1
+
+search/jump_search.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d6/dc0/interpolation__search2_8cpp__incl.map b/d6/dc0/interpolation__search2_8cpp__incl.map
new file mode 100644
index 000000000..256e36895
--- /dev/null
+++ b/d6/dc0/interpolation__search2_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d6/dc0/interpolation__search2_8cpp__incl.md5 b/d6/dc0/interpolation__search2_8cpp__incl.md5
new file mode 100644
index 000000000..69fb8c659
--- /dev/null
+++ b/d6/dc0/interpolation__search2_8cpp__incl.md5
@@ -0,0 +1 @@
+235c2a71c502fc4e41a01cc1ac9b3c97
\ No newline at end of file
diff --git a/d6/dc0/interpolation__search2_8cpp__incl.svg b/d6/dc0/interpolation__search2_8cpp__incl.svg
new file mode 100644
index 000000000..62ca0b2a8
--- /dev/null
+++ b/d6/dc0/interpolation__search2_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+search/interpolation_search2.cpp
+
+Node1
+
+search/interpolation
+_search2.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
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
new file mode 100644
index 000000000..cfa7dc8ce
--- /dev/null
+++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
@@ -0,0 +1,215 @@
+
+
+
+Algorithms_in_C++: CONTRIBUTION GUIDELINES
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Welcome to TheAlgorithms/C-Plus-Plus ! Before submitting pull requests, please make sure that you have read the whole guidelines . If you have any doubts about this contribution guide, please open an issue and clearly state your concerns.
+
+
+
We are very happy that you consider implementing algorithms and data structures for others! This repository is referred to and used by learners from around the globe. Being one of our contributors, you agree and confirm that:
+You did your own work.
+No plagiarism allowed. Any plagiarized work will not be merged.
+
+
+Your work will be distributed under [MIT License](License) once your pull request has been merged.
+You submitted work fulfils or mostly fulfils our styles and standards.
+
+
New implementation New implementation are welcome!
+
Improving comments and adding tests to existing algorithms are much appreciated.
+
Issues Please avoid opening issues asking to be "assigned” to a particular algorithm. This merely creates unnecessary noise for maintainers. Instead, please submit your implementation in a pull request and it will be evaluated by project maintainers.
+
+
+
+Please use the directory structure of the repository.
+File extension for code should be *.h *.cpp.
+Don't use bits/stdc++.h because this is quite Linux specific and slows down the compilation process.
+Avoid using struct and instead use the class keyword.
+You can suggest reasonable changes to existing algorithms.
+Strictly use snake_case (underscore_separated) in filenames.
+If you have added or modified code, please make sure the code compiles before submitting.
+Our automated testing runs cpplint
+Be consistent in use of these guidelines.
+
+
+Use lowercase words with "_" as separator
+For instance MyNewCppClass.CPP is incorrect
+
my_new_cpp_class.cpp is correct format
+
+It will be used to dynamically create a directory of files and implementation.
+File name validation will run on docker to ensure the validity.
+
+
+
+We recommend adding files to existing directories as much as possible.
+Use lowercase words with "_" as separator ( no spaces or "-" allowed )
+For instance SomeNew Fancy-Category is incorrect
+
some_new_fancy_category is correct
+
+Filepaths will be used to dynamically create a directory of our algorithms.
+Filepath validation will run on GitHub Actions to ensure compliance.
+
+
+
+It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilt across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected. git add file_xyz.cpp
+
git commit -m "your message"
+
+
+
Examples of commit messages with semantic prefixes:
fix: xyz algorithm bug
+
feat: add xyx algorithm, class xyz
+
test: add test for xyz algorithm
+
docs: add comments and explanation to xyz algorithm
+
Common prefixes:
+fix: A bug fix
+feat: A new feature
+docs: Documentation changes
+test: Correct existing tests or add new ones
+
+
+
+Make sure you put useful comments in your code. Do not comment things that are obvious.
+Please avoid creating new directories if at all possible. Try to fit your work into the existing directory structure. If you want to create a new directory, then please check if a similar category has been recently suggested or created by other pull requests.
+If you have modified/added documentation, please ensure that your language is concise and contains no grammar errors.
+Do not update README.md along with other changes, first create an issue and then link to that issue in your pull request to suggest specific changes required to README.md
+
+
+
+Make sure to add examples and test cases in your main() function.
+If you find any algorithm or document without tests, please feel free to create a pull request or issue describing suggested changes.
+
+
+
+
+
To see if cpplint
+cpplint --version # currently returns "cpplint 1.4.4" If cpplint is ___not___ installed then do:python3 -m pip install cpplint # If that does not work then try...py -m pip install cpplint # If that does not work then try...pip install cpplint Once cpplint is installed, test your file(s) with:cpplint --filter=-legal my_file.cpp my_other_file.cpp # Fix any issues and try again.
+
The clang-format cpplint issues.
+On Macs only: brew install clang-format # Only needs to be installed once.
+All platforms: clang-format -i -style="{IndentWidth: 4}" my_file.cpp
+
+
Most importantly,
+
+
+
Algorithms_in_C++: strings/rabin_karp.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+More...
+
#include <cassert>#include <cmath>#include <iostream>#include <cstring>
+PRIME 5 Prime modulus for hash functions.
+int64_t string_search::create_hash (const std::string &s, int n) int64_t string_search::recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength) bool string_search::check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2) int string_search::rabin_karp (const std::string &str, const std::string &pat) int main (void)
+
+
The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
Main function
+
+
106 assert(
rabin_karp (
"helloWorld" ,
"world" ) == -1);
+
107 assert(
rabin_karp (
"helloWorld" ,
"World" ) == 5);
+
108 assert(
rabin_karp (
"this_is_c++" ,
"c++" ) == 8);
+
109 assert(
rabin_karp (
"happy_coding" ,
"happy" ) == 0);
+
+
+
+
+
+
+
+
+
int rabin_karp(const std::string &str, const std::string &pat)
Definition: rabin_karp.cpp:83
+
diff --git a/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
new file mode 100644
index 000000000..9c8c5fd1b
--- /dev/null
+++ b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
@@ -0,0 +1 @@
+6de677024932aff75bca7d32e548553d
\ No newline at end of file
diff --git a/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
new file mode 100644
index 000000000..85f82291f
--- /dev/null
+++ b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+string_search::rabin_karp
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+string_search::check
+_if_equal
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+string_search::create_hash
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+string_search::recalculate_hash
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+std::string::size
+
+
+
+
+Node2->Node6
+
+
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp.html b/d6/dd3/ode__midpoint__euler_8cpp.html
new file mode 100644
index 000000000..3fb3a30c6
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp.html
@@ -0,0 +1,414 @@
+
+
+
+Algorithms_in_C++: numerical_methods/ode_midpoint_euler.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
+More...
+
#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>
+void problem (const double &x, std::valarray < double > *y, std::valarray < double > *dy) Problem statement for a system with first-order differential equations. Updates the system differential variables. More... void exact_solution (const double &x, std::valarray < double > *y) Exact solution of the problem. Used for solution comparison. More... void midpoint_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the midpoint-Euler method. More... double midpoint_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the midpoint-Euler method in the given limits. More... void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray < double > &Y0) int main (int argc, char *argv[])
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
+
Authors Krishna Vedala
+
The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*}
+
+
The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*}
+
+
The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison.
+
To implement Van der Pol oscillator , change the problem function to:
const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also ode_forward_euler.cpp , ode_semi_implicit_euler.cpp
+
+
+
◆
+
+
+
+
+
+ void exact_solution
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y
+
+ )
+
+
+
+
+
Exact solution of the problem. Used for solution comparison.
+
Parameters
+
+ [in] x independent variable [in,out] y dependent variable
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
Main Function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
207 double total_time =
midpoint_euler (step_size, X0, X_MAX, &Y0,
true );
+
208 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void problem
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+
Note This function can be updated to and ode of any order.
+
Parameters
+
+ [in] x independent variable(s) [in,out] y dependent variable(s) [in,out] dy first-derivative of dependent variable(s)
+
+
+
+
55 const double omega = 1.F;
+
+
57 dy[0][1] = -omega * omega * y[0][0];
+
+
+
+
+
+
◆
+
+
+
+
+
+ void save_exact_solution
+ (
+ const double &
+ X0 ,
+
+ const double &
+ X_MAX ,
+
+ const double &
+ step_size ,
+
+ const std::valarray < double > &
+ Y0
+
+ )
+
+
+
+
Function to compute and save exact solution for comparison
+
Parameters
+
+ [in] X0 initial value of independent variable [in] X_MAX final value of independent variable [in] step_size independent variable step size [in] Y0 initial values of dependent variables
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
172 for (
int i = 0; i < y.size() - 1; i++) {
+
+
+
175 fp << y[y.size() - 1] <<
"\n" ;
+
+
+
+
+
180 }
while (x <= X_MAX);
+
+
+
183 double total_time =
static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
184 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_midpoint_euler.cpp:156
double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the midpoint-Euler method in the given limits.
Definition: ode_midpoint_euler.cpp:107
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_midpoint_euler.cpp:66
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..f746eb196
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+179f2373f41150d290344eb4693b0e36
\ 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
new file mode 100644
index 000000000..3ea2d0dc5
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,241 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::atof
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+midpoint_euler
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+save_exact_solution
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+std::clock
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::ofstream::close
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+std::ofstream::is_open
+
+
+
+
+Node3->Node6
+
+
+
+Node7
+
+midpoint_euler_step
+
+
+
+
+Node3->Node7
+
+
+
+Node9
+
+std::ofstream::open
+
+
+
+
+Node3->Node9
+
+
+
+Node10
+
+std::perror
+
+
+
+
+Node3->Node10
+
+
+
+Node8
+
+problem
+
+
+
+
+Node7->Node8
+
+
+
+Node11->Node4
+
+
+
+Node11->Node5
+
+
+
+Node11->Node6
+
+
+
+Node11->Node10
+
+
+
+Node12
+
+exact_solution
+
+
+
+
+Node11->Node12
+
+
+
+Node13
+
+std::cos
+
+
+
+
+Node12->Node13
+
+
+
+Node14
+
+std::sin
+
+
+
+
+Node12->Node14
+
+
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
new file mode 100644
index 000000000..bcb6bdc60
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
new file mode 100644
index 000000000..361c0aa64
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
@@ -0,0 +1 @@
+ee2dd8e73a9acf5670fad571ee16575e
\ 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
new file mode 100644
index 000000000..ad9eed8d3
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+save_exact_solution
+
+Node1
+
+save_exact_solution
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+exact_solution
+
+
+
+
+Node1->Node4
+
+
+
+Node7
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::perror
+
+
+
+
+Node1->Node8
+
+
+
+Node5
+
+std::cos
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::sin
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
new file mode 100644
index 000000000..fbb37ebae
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
new file mode 100644
index 000000000..53dab073e
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
@@ -0,0 +1 @@
+28f68d690a34e83ed529b0e7cf875a9c
\ 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
new file mode 100644
index 000000000..6b0aebf2e
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+exact_solution
+
+Node1
+
+exact_solution
+
+
+
+
+Node2
+
+std::cos
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sin
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d7/d1f/realtime__stats_8cpp__incl.map b/d7/d1f/realtime__stats_8cpp__incl.map
new file mode 100644
index 000000000..95dfd3df2
--- /dev/null
+++ b/d7/d1f/realtime__stats_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d7/d1f/realtime__stats_8cpp__incl.md5 b/d7/d1f/realtime__stats_8cpp__incl.md5
new file mode 100644
index 000000000..e83a6940e
--- /dev/null
+++ b/d7/d1f/realtime__stats_8cpp__incl.md5
@@ -0,0 +1 @@
+b3b7df6f5ed3158b2bb6313ff48c1e0d
\ No newline at end of file
diff --git a/d7/d1f/realtime__stats_8cpp__incl.svg b/d7/d1f/realtime__stats_8cpp__incl.svg
new file mode 100644
index 000000000..51e874ead
--- /dev/null
+++ b/d7/d1f/realtime__stats_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+math/realtime_stats.cpp
+
+Node1
+
+math/realtime_stats.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d7/d21/classstack__linked_list-members.html b/d7/d21/classstack__linked_list-members.html
new file mode 100644
index 000000000..c84a40d0b
--- /dev/null
+++ b/d7/d21/classstack__linked_list-members.html
@@ -0,0 +1,117 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for stack_linkedList , including all inherited members.
+
+
+
diff --git a/d7/d2e/avltree_8cpp__incl.md5 b/d7/d2e/avltree_8cpp__incl.md5
new file mode 100644
index 000000000..5103045a0
--- /dev/null
+++ b/d7/d2e/avltree_8cpp__incl.md5
@@ -0,0 +1 @@
+e94afef857b532e8135f60ebca3d7126
\ No newline at end of file
diff --git a/d7/d2e/avltree_8cpp__incl.svg b/d7/d2e/avltree_8cpp__incl.svg
new file mode 100644
index 000000000..731180da3
--- /dev/null
+++ b/d7/d2e/avltree_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+data_structures/avltree.cpp
+
+Node1
+
+data_structures/avltree.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+queue
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html
new file mode 100644
index 000000000..314577976
--- /dev/null
+++ b/d7/d35/matrix__exponentiation_8cpp.html
@@ -0,0 +1,495 @@
+
+
+
+Algorithms_in_C++: others/matrix_exponentiation.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Matrix Exponentiation.
+More...
+
#include <iostream>#include <vector>
+#define ll int64_t #define endl std::endl #define pb push_back MOD 1000000007
+
+
Matrix Exponentiation.
+
The problem can be solved with DP but constraints are high.
+
Steps for Matrix Expo
+Create vector F1 : which is the copy of B.
+Create transpose matrix (Learn more about it on the internet)
+Perform \(T^{n-1}\) [transpose matrix to the power n-1]
+Multiply with F to get the last matrix of size (1 \(\times\)k).
+
+
The first element of this matrix is the required result.
+
+
+
◆
+
+
+
+
+
+ #define endl std::endl
+
+
+
+
+
+
◆
+
+
+
+
+
+ #define ll int64_t
+
+
+
+
shorthand definition for int64_t
+
+
+
+
+
◆
+
+
+
+
+
+ #define pb push_back
+
+
+
+
shorthand definition for int64_t
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ ll ab (
+ ll x )
+
+
+
+
+inline
+
+
+
+
returns absolute value
+
43 {
return x > 0LL ? x : -x; }
+
+
+
+
+
◆
+
+
+
+
+
+ ll ans (
+ ll n )
+
+
+
+
Wrapper for Fibonacci
Parameters
+
+ [in] n \(n^\text{th}\) Fibonacci number
+
+
+
Returns \(n^\text{th}\) Fibonacci number
+
+
+
+
+
+
+
+
101 for (ll i = 1; i <=
k ; i++) F1[i] = b[i - 1];
+
+
+
+
105 for (ll i = 1; i <=
k ; i++) {
+
106 for (ll j = 1; j <=
k ; j++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
122 for (ll i = 1; i <=
k ; i++) {
+
123 res = (res + (T[1][i] * F1[i]) % MOD) % MOD;
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
137 for (i = 0; i <
k ; i++) {
+
+
+
+
141 for (i = 0; i <
k ; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
To multiply 2 matrices
Parameters
+
+ [in] A matrix 1 of size (m \(\times\)n) [in] B matrix 2 of size (p \(\times\)q)
+
+
+
Note \(p=n\)
+
Returns matrix of dimension (m \(\times\)q)
+
+
+
63 for (ll i = 1; i <=
k ; i++) {
+
64 for (ll j = 1; j <=
k ; j++) {
+
65 for (ll z = 1; z <=
k ; z++) {
+
66 C[i][j] = (C[i][j] + (A[i][z] * B[z][j]) % MOD) % MOD;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
computing integer power of a matrix using recursive multiplication.
Note A must be a square matrix for this algorithm.
+
Parameters
+
+ [in] A base matrix [in] p exponent
+
+
+
Returns matrix of same dimension as A
+
+
+
+
+
+
+
+
+
+
+
+
global vector variables
Todo: @stepfencurryxiao add documetnation
+
+
+
+
+
+
+
+
+
global variable k
Todo: @stepfencurryxiao add documetnation
+
+
+
+
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
vector< vector< ll > > multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B)
Definition: matrix_exponentiation.cpp:60
ll k
Definition: matrix_exponentiation.cpp:48
#define endl
Definition: matrix_exponentiation.cpp:36
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:79
+
diff --git a/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5
new file mode 100644
index 000000000..2705e60bc
--- /dev/null
+++ b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5
@@ -0,0 +1 @@
+bce3e1ffabf6cff3904bb1331eef0c1c
\ No newline at end of file
diff --git a/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg
new file mode 100644
index 000000000..fd744ec7b
--- /dev/null
+++ b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+power
+
+Node1
+
+power
+
+
+
+
+Node2
+
+multiply
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map
new file mode 100644
index 000000000..adc667f31
--- /dev/null
+++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5
new file mode 100644
index 000000000..a545c201a
--- /dev/null
+++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5
@@ -0,0 +1 @@
+3e4551f597c958e7473a1efec3b99929
\ No newline at end of file
diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg
new file mode 100644
index 000000000..6943eb877
--- /dev/null
+++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+data_structures/linkedlist_implentation_usingarray.cpp
+
+Node1
+
+data_structures/linkedlist
+_implentation_usingarray.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/d40/class_solution__coll__graph.map b/d7/d40/class_solution__coll__graph.map
new file mode 100644
index 000000000..2f07ac662
--- /dev/null
+++ b/d7/d40/class_solution__coll__graph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d7/d40/class_solution__coll__graph.md5 b/d7/d40/class_solution__coll__graph.md5
new file mode 100644
index 000000000..be5cef09c
--- /dev/null
+++ b/d7/d40/class_solution__coll__graph.md5
@@ -0,0 +1 @@
+ce60b53d466fcb7e2a8c37c433b4bd3c
\ No newline at end of file
diff --git a/d7/d40/class_solution__coll__graph.svg b/d7/d40/class_solution__coll__graph.svg
new file mode 100644
index 000000000..b8c635966
--- /dev/null
+++ b/d7/d40/class_solution__coll__graph.svg
@@ -0,0 +1,73 @@
+
+
+
+
+
+
+Solution
+
+Node1
+
+Solution
+
+
+
+
+Node2
+
+std::vector< vector
+< int > >
+
+
+
+
+Node2->Node1
+ bridge
+graph
+
+
+
+Node3
+
+std::vector< int >
+
+
+
+
+Node3->Node1
+ out_time
+in_time
+
+
+
+Node4
+
+std::vector< bool >
+
+
+
+
+Node4->Node1
+ visited
+
+
+
diff --git a/d7/d41/struct_min_heap_node__coll__graph.map b/d7/d41/struct_min_heap_node__coll__graph.map
new file mode 100644
index 000000000..a78d64432
--- /dev/null
+++ b/d7/d41/struct_min_heap_node__coll__graph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d7/d41/struct_min_heap_node__coll__graph.md5 b/d7/d41/struct_min_heap_node__coll__graph.md5
new file mode 100644
index 000000000..49191aa25
--- /dev/null
+++ b/d7/d41/struct_min_heap_node__coll__graph.md5
@@ -0,0 +1 @@
+7e7ea6ae4fdc104842f3dccad98d59f4
\ No newline at end of file
diff --git a/d7/d41/struct_min_heap_node__coll__graph.svg b/d7/d41/struct_min_heap_node__coll__graph.svg
new file mode 100644
index 000000000..db2c50f7d
--- /dev/null
+++ b/d7/d41/struct_min_heap_node__coll__graph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+MinHeapNode
+
+Node1
+
+MinHeapNode
+
+
+
+
+Node1->Node1
+ right
+left
+
+
+
diff --git a/d7/d4c/spiral__print_8cpp__incl.map b/d7/d4c/spiral__print_8cpp__incl.map
new file mode 100644
index 000000000..e54d263c6
--- /dev/null
+++ b/d7/d4c/spiral__print_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d7/d4c/spiral__print_8cpp__incl.md5 b/d7/d4c/spiral__print_8cpp__incl.md5
new file mode 100644
index 000000000..b8058267e
--- /dev/null
+++ b/d7/d4c/spiral__print_8cpp__incl.md5
@@ -0,0 +1 @@
+ff926f0d205e560434ae25a2a6f68d1e
\ No newline at end of file
diff --git a/d7/d4c/spiral__print_8cpp__incl.svg b/d7/d4c/spiral__print_8cpp__incl.svg
new file mode 100644
index 000000000..648a8589b
--- /dev/null
+++ b/d7/d4c/spiral__print_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/spiral_print.cpp
+
+Node1
+
+others/spiral_print.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/d6a/bisection__method_8cpp.html b/d7/d6a/bisection__method_8cpp.html
new file mode 100644
index 000000000..765778a5d
--- /dev/null
+++ b/d7/d6a/bisection__method_8cpp.html
@@ -0,0 +1,277 @@
+
+
+
+Algorithms_in_C++: numerical_methods/bisection_method.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve the equation \(f(x)=0\) using bisection method
+More...
+
#include <cmath>#include <iostream>#include <limits>
+EPSILON 1e-6 MAX_ITERATIONS 50000 Maximum number of iterations to check.
+static double eq (double i) template<typename T > int sgn (T val) int main ()
+
+
Solve the equation \(f(x)=0\) using bisection method
+
Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = \frac{a_i+b_i}{2} \]
+
+
For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.
+
See also newton_raphson_method.cpp , false_position.cpp , secant_method.cpp
+
+
+
◆
+
+
+
+
+
+
+
+
+ static double eq
+ (
+ double
+ i )
+
+
+
+
+static
+
+
+
+
define \(f(x)\) to find root for
+
+
27 return (
std::pow (i, 3) - (4 * i) - 9);
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
38 double a = -1, b = 1, x, z;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
60 std::cout <<
"\n\nz: " << z <<
"\t[" <<
a <<
" , " << b
+
61 <<
" | Bisect: " << x <<
"]" ;
+
+
+
+
+
+
+
+
69 if (std::abs(z) < EPSILON)
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ int sgn
+ (
+ T
+ val )
+
+
+
+
get the sign of any given number
+
+
33 return (T(0) < val) - (val < T(0));
+
+
+
+
+
+
int sgn(T val)
Definition: bisection_method.cpp:32
vector< ll > a
Definition: matrix_exponentiation.cpp:53
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
static double eq(double i)
Definition: bisection_method.cpp:26
+
diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
new file mode 100644
index 000000000..ecfa65278
--- /dev/null
+++ b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
@@ -0,0 +1 @@
+ebb04cd15e67d7a7b151a478105c7fad
\ 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
new file mode 100644
index 000000000..c3eea1476
--- /dev/null
+++ b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+eq
+
+Node1
+
+eq
+
+
+
+
+Node2
+
+std::pow
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/d77/class_edge.html b/d7/d77/class_edge.html
new file mode 100644
index 000000000..5a25a63f6
--- /dev/null
+++ b/d7/d77/class_edge.html
@@ -0,0 +1,202 @@
+
+
+
+Algorithms_in_C++: Edge Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Edge (Edge &&)=default Edge & operator= (Edge &&)=default Edge (Edge const &)=default Edge & operator= (Edge const &)=default Edge (unsigned int source, unsigned int destination)
+src dst weight src dest
+
+
Implementation of non-weighted directed edge of a graph.
+
The source vertex of the edge is labelled "src" and destination vertex is labelled "dest".
+
+
+
◆
+
+
+
+
+
+
+
+
+ Edge::Edge
+ (
+ unsigned int
+ source ,
+
+ unsigned int
+ destination
+
+ )
+
+
+
+
+inline
+
+
+
+
Set the source and destination of the vertex.
+
Parameters
+
+ source is the source vertex of the edge. destination is the destination vertex of the edge.
+
+
+
43 : src(source), dest(destination) {}
+
+
+
+
The documentation for this struct was generated from the following files:
+dynamic_programming/bellman_ford.cpp
+graph/cycle_check_directed_graph.cpp
+
+
+
Algorithms_in_C++: statistics::stats_computer1< T > Class Template Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+n = 0 Ex Ex2 K
+
+
template<typename T>
+
+
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.
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return sample mean computed till last sample
+
42 {
return K + Ex / n; }
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Constructor
Parameters
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return sample standard deviation computed till last sample
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return data variance computed till last sample
+
45 {
return (Ex2 - (Ex * Ex) / n) / (n - 1); }
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
short-hand operator to read new sample from input stream std::cin >> stats1;
+
+
+
+
The documentation for this class was generated from the following file:
+
+
void new_val(T x)
Definition: realtime_stats.cpp:32
double variance() const
Definition: realtime_stats.cpp:45
+
diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5
new file mode 100644
index 000000000..c18808d80
--- /dev/null
+++ b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5
@@ -0,0 +1 @@
+bbccf549f6b3cbeb289f6fb78a720683
\ 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
new file mode 100644
index 000000000..da5a92c25
--- /dev/null
+++ b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+statistics::stats_computer1::std
+
+Node1
+
+statistics::stats_computer1::std
+
+
+
+
+Node2
+
+std::sqrt
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+statistics::stats_computer1
+::variance
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d7/d7f/section.html b/d7/d7f/section.html
new file mode 100644
index 000000000..6cceddf93
--- /dev/null
+++ b/d7/d7f/section.html
@@ -0,0 +1,114 @@
+
+
+
+Algorithms_in_C++: Prime factorization
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.
+
The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.
+
Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.
+
The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).
+
Requirements: For compile you need the compiler flag for C++ 11
+
+
+
Algorithms_in_C++: math/double_factorial.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute double factorial: \(n!!\).
+More...
+
#include <cassert>#include <iostream>
+
+
Compute double factorial: \(n!!\).
+
Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
+
+
+
◆
+
+
+
+
+
+ uint64_t double_factorial_iterative
+ (
+ uint64_t
+ n )
+
+
+
+
Compute double factorial using iterative method
+
+
+
18 for (uint64_t i = n;; i -= 2) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ uint64_t double_factorial_recursive
+ (
+ uint64_t
+ n )
+
+
+
+
Compute double factorial using resursive method.
+
+
+
+
+
uint64_t double_factorial_recursive(uint64_t n)
Definition: double_factorial.cpp:29
+
diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.md5 b/d7/d8e/power__for__huge__numbers_8cpp__incl.md5
new file mode 100644
index 000000000..f676f11d9
--- /dev/null
+++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.md5
@@ -0,0 +1 @@
+a65d1bd06b60f159a2fc8d1439430277
\ No newline at end of file
diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.svg b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg
new file mode 100644
index 000000000..dd5b93f6a
--- /dev/null
+++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+math/power_for_huge_numbers.cpp
+
+Node1
+
+math/power_for_huge
+_numbers.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/da7/adaline__learning_8cpp__incl.map b/d7/da7/adaline__learning_8cpp__incl.map
new file mode 100644
index 000000000..91df185f9
--- /dev/null
+++ b/d7/da7/adaline__learning_8cpp__incl.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d7/da7/adaline__learning_8cpp__incl.md5 b/d7/da7/adaline__learning_8cpp__incl.md5
new file mode 100644
index 000000000..cedf8bf65
--- /dev/null
+++ b/d7/da7/adaline__learning_8cpp__incl.md5
@@ -0,0 +1 @@
+2c460f64cc40edc34dfb964b2ad9d6ed
\ No newline at end of file
diff --git a/d7/da7/adaline__learning_8cpp__incl.svg b/d7/da7/adaline__learning_8cpp__incl.svg
new file mode 100644
index 000000000..7d011e50e
--- /dev/null
+++ b/d7/da7/adaline__learning_8cpp__incl.svg
@@ -0,0 +1,231 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning/adaline_learning.cpp
+
+Node1
+
+machine_learning/adaline
+_learning.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cmath
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstdlib
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+ctime
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+numeric
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d7/da7/adaline__learning_8cpp__incl_org.svg b/d7/da7/adaline__learning_8cpp__incl_org.svg
new file mode 100644
index 000000000..efd92d715
--- /dev/null
+++ b/d7/da7/adaline__learning_8cpp__incl_org.svg
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+machine_learning/adaline_learning.cpp
+
+Node1
+
+machine_learning/adaline
+_learning.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cmath
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstdlib
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+ctime
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+numeric
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+vector
+
+
+
+
+Node1->Node9
+
+
+
diff --git a/d7/dae/decimal__to__binary_8cpp__incl.map b/d7/dae/decimal__to__binary_8cpp__incl.map
new file mode 100644
index 000000000..995176dd2
--- /dev/null
+++ b/d7/dae/decimal__to__binary_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d7/dae/decimal__to__binary_8cpp__incl.md5 b/d7/dae/decimal__to__binary_8cpp__incl.md5
new file mode 100644
index 000000000..fabfa8574
--- /dev/null
+++ b/d7/dae/decimal__to__binary_8cpp__incl.md5
@@ -0,0 +1 @@
+b8a280bcd9ccc6b135af936b4a3a689f
\ No newline at end of file
diff --git a/d7/dae/decimal__to__binary_8cpp__incl.svg b/d7/dae/decimal__to__binary_8cpp__incl.svg
new file mode 100644
index 000000000..0ddad5f8f
--- /dev/null
+++ b/d7/dae/decimal__to__binary_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/decimal_to_binary.cpp
+
+Node1
+
+others/decimal_to_binary.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html
new file mode 100644
index 000000000..85e198fba
--- /dev/null
+++ b/d7/dba/cll_8h_source.html
@@ -0,0 +1,198 @@
+
+
+
+Algorithms_in_C++: data_structures/cll/cll.h Source File
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
26 void insert_front(
int new_data);
+
27 void insert_tail(
int new_data);
+
+
29 bool find_item(
int item_to_find);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
MinHeap(int capacity)
Definition: binaryheap.cpp:50
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
void deleteKey(int i)
Definition: binaryheap.cpp:107
Definition: binaryheap.cpp:10
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
Definition: avltree.cpp:13
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:78
void levelOrder(node *root)
Definition: avltree.cpp:119
Definition: binary_search_tree.cpp:17
void insertKey(int k)
Definition: binaryheap.cpp:57
node * createNode(int data)
Definition: avltree.cpp:21
int capacity
maximum possible size of min heap
Definition: binaryheap.cpp:12
node * insert(node *root, int item)
Definition: avltree.cpp:66
int h(int key)
Definition: hash_search.cpp:45
ll k
Definition: matrix_exponentiation.cpp:48
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
void MinHeapify(int)
Definition: binaryheap.cpp:115
int height(node *root)
Definition: avltree.cpp:31
node * rightRotate(node *root)
Definition: avltree.cpp:41
#define endl
Definition: matrix_exponentiation.cpp:36
int left(int i)
Definition: binaryheap.cpp:28
int data[MAX]
test data
Definition: hash_search.cpp:24
node * minValue(node *root)
Definition: avltree.cpp:59
int main()
Definition: avltree.cpp:134
node * leftRotate(node *root)
Definition: avltree.cpp:50
Definition: circular_queue_using_linked_list.cpp:7
int getMin()
Definition: binaryheap.cpp:40
int getBalance(node *root)
Definition: avltree.cpp:38
int extractMin()
Definition: binaryheap.cpp:87
int right(int i)
Definition: binaryheap.cpp:31
Algorithms_in_C++: data_structures/stack.h Source File
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
2 #ifndef DATA_STRUCTURES_STACK_H_
+
3 #define DATA_STRUCTURES_STACK_H_
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
23 while (current != NULL) {
+
+
25 current = current->next;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
91 current = current->next;
+
+
93 while (current != NULL) {
+
+
95 newNode->data = current->data;
+
+
+
+
99 current = current->next;
+
+
+
102 size = otherStack.size;
+
+
+
+
+
+
+
+
+
111 #endif // DATA_STRUCTURES_STACK_H_
+
+
void pop()
Definition: stack.h:60
Definition: avltree.cpp:13
Definition: queue_using_linkedlist.cpp:10
Definition: queue_using_linkedlist.cpp:6
void push(Type item)
Definition: stack.h:44
Type top()
Definition: stack.h:54
int data[MAX]
test data
Definition: hash_search.cpp:24
stack()
Definition: stack.h:32
stack< Type > & operator=(const stack< Type > &otherStack)
Definition: stack.h:76
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int main()
Definition: avltree.cpp:134
Definition: queue_using_array.cpp:13
void display()
Definition: stack.h:20
bool isEmptyStack()
Definition: stack.h:41
node< Type > * stackTop
Definition: stack.h:107
~stack()
Definition: stack.h:38
void clear()
Definition: stack.h:73
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Item , including all inherited members.
+
+
Algorithms_in_C++: list Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+BinarySearch (int *array , int first, int last, int x) LinarSearch (int *array , int x) Search (int x) Sort () insert (int x) Remove (int x) Show ()
+data [50] top = 0 isSorted = false key key value for node list * next pointer to next link in the chain
+
+
The documentation for this struct was generated from the following files:
+
+
Algorithms_in_C++: sorting/bubble_sort.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Bubble sort algorithm.
+More...
+
#include <iostream>#include <vector>
+
+
Bubble sort algorithm.
+
The working principle of the Bubble sort algorithm:
+
Bubble sort algorithm is the bubble sorting algorithm. The most important reason for calling the bubble is that the largest number is thrown at the end of this algorithm. This is all about the logic. In each iteration, the largest number is expired and when iterations are completed, the sorting takes place.
+
What is Swap?
+
Swap in the software means that two variables are displaced. An additional variable is required for this operation. x = 5, y = 10. We want x = 10, y = 5. Here we create the most variable to do it.
+
int z; z = x; x = y; y = z;
+
The above process is a typical displacement process. When x assigns the value to x, the old value of x is lost. That's why we created a variable z to create the first value of the value of x, and finally, we have assigned to y.
+
Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)
+
Bubble Sort Worst Case Performance is O (n²). Why is that? Because if you remember Big O Notation, we were calculating the complexity of the algorithms in the nested loops. The n * (n - 1) product gives us O (n²) performance. In the worst case all the steps of the cycle will occur. Bubble Sort (Avarage Case) Performance. Bubble Sort is not an optimal algorithm. in average, O (n²) performance is taken. Bubble Sort Best Case Performance. O (n). However, you can't get the best status in the code we shared above. This happens on the optimized bubble sort algorithm. It's right down there.
+
+
Algorithms_in_C++: data_structures/queue.h Source File
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
2 #ifndef DATA_STRUCTURES_QUEUE_H_
+
3 #define DATA_STRUCTURES_QUEUE_H_
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
23 while (current != NULL) {
+
+
25 current = current->next;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
88 #endif // DATA_STRUCTURES_QUEUE_H_
+
+
void deQueue()
Definition: queue.h:67
Definition: avltree.cpp:13
node< Kind > * queueRear
Definition: queue.h:84
int main()
Definition: linkedlist_implentation_usingarray.cpp:79
Kind front()
Definition: queue.h:61
~queue()
Definition: queue.h:39
Definition: linkedlist_implentation_usingarray.cpp:14
Definition: binary_search_tree.cpp:17
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
void clear()
Definition: queue.h:80
node * insert(node *root, int item)
Definition: avltree.cpp:66
queue()
Definition: queue.h:32
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
#define endl
Definition: matrix_exponentiation.cpp:36
bool isEmptyQueue()
Definition: queue.h:42
int getnode()
Definition: linkedlist_implentation_usingarray.cpp:32
vector< ll > a
Definition: matrix_exponentiation.cpp:53
node< Kind > * queueFront
Definition: queue.h:83
int data[MAX]
test data
Definition: hash_search.cpp:24
void display()
Definition: queue.h:20
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int main()
Definition: avltree.cpp:134
void freeNode(int nodeToBeDeleted)
Definition: linkedlist_implentation_usingarray.cpp:42
void enQueue(Kind item)
Definition: queue.h:45
Definition: morrisinorder.cpp:10
Definition: doubly_linked_list.cpp:11
Node AvailArray[100]
array that will act as nodes of a linked list.
Definition: linkedlist_implentation_usingarray.cpp:19
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for query , including all inherited members.
+
+
Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ Program to find the modular inverse using Fermat's Little Theorem
+More...
+
#include <iostream>#include <vector>
+int64_t binExpo (int64_t a , int64_t b, int64_t m) bool isPrime (int64_t m) int main ()
+
+
C++ Program to find the modular inverse using Fermat's Little Theorem
+
Fermat's Little Theorem state that
+\[ϕ(m) = m-1\]
+
+
where \(m\) is a prime number.
+\begin{eqnarray*} a \cdot x &≡& 1 \;\text{mod}\; m\\ x &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*}
+
+
Using Euler's theorem we can modify the equation.
+\[ a^{ϕ(m)} ≡ 1 \;\text{mod}\; m \]
+
+
(Where '^' denotes the exponent operator)
+
Here 'ϕ' is Euler's Totient Function. For modular inverse existence 'a' and 'm' must be relatively primes numbers. To apply Fermat's Little Theorem is necessary that 'm' must be a prime number. Generally in many competitive programming competitions 'm' is either 1000000007 (1e9+7) or 998244353.
+
We considered m as large prime (1e9+7). \(a^{ϕ(m)} ≡ 1 \;\text{mod}\; m\) (Using Euler's Theorem) \(ϕ(m) = m-1\) using Fermat's Little Theorem. \(a^{m-1} ≡ 1 \;\text{mod}\; m\) Now multiplying both side by \(a^{-1}\).
+\begin{eqnarray*} a^{m-1} \cdot a^{-1} &≡& a^{-1} \;\text{mod}\; m\\ a^{m-2} &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*}
+
+
We will find the exponent using binary exponentiation. Such that the algorithm works in \(O(\log m)\) time.
+
Examples: -
+a = 3 and m = 7
+\(a^{-1} \;\text{mod}\; m\) is equivalent to \(a^{m-2} \;\text{mod}\; m\)
+\(3^5 \;\text{mod}\; 7 = 243 \;\text{mod}\; 7 = 5\)
+
+
+
+
◆
+
+
+
+
+
+ int64_t binExpo
+ (
+ int64_t
+ a ,
+
+ int64_t
+ b ,
+
+ int64_t
+ m
+
+ )
+
+
+
+
Recursive function to calculate exponent in \(O(\log n)\) using binary exponent.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool isPrime
+ (
+ int64_t
+ m )
+
+
+
+
Prime check in \(O(\sqrt{m})\) time.
+
+
+
+
+
72 for (int64_t i = 2; i * i <= m; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
87 std::cout <<
"Computing ((a^(-1))%(m)) using Fermat's Little Theorem" ;
+
+
89 std::cout <<
"Give input 'a' and 'm' space separated : " ;
+
+
+
92 std::cout <<
"The modular inverse of a with mod m is (a^(m-2)) : " ;
+
+
+
+
+
+
+
+
+
+
+
+
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
+
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
new file mode 100644
index 000000000..d034c3d15
--- /dev/null
+++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+6d147c073aa061ad9d2b2b862712d793
\ 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
new file mode 100644
index 000000000..497926522
--- /dev/null
+++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+binExpo
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+isPrime
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d8/d55/class_cycle_check-members.html b/d8/d55/class_cycle_check-members.html
new file mode 100644
index 000000000..cd7390075
--- /dev/null
+++ b/d8/d55/class_cycle_check-members.html
@@ -0,0 +1,118 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for CycleCheck , including all inherited members.
+
+
+
diff --git a/d8/d61/class_trie__coll__graph.md5 b/d8/d61/class_trie__coll__graph.md5
new file mode 100644
index 000000000..9d1a0631b
--- /dev/null
+++ b/d8/d61/class_trie__coll__graph.md5
@@ -0,0 +1 @@
+55078045c550e8d22987b0668eeeda56
\ No newline at end of file
diff --git a/d8/d61/class_trie__coll__graph.svg b/d8/d61/class_trie__coll__graph.svg
new file mode 100644
index 000000000..ee1fbdf5f
--- /dev/null
+++ b/d8/d61/class_trie__coll__graph.svg
@@ -0,0 +1,62 @@
+
+
+
+
+
+
+Trie
+
+Node1
+
+Trie
+
+
+
+
+Node2
+
+std::shared_ptr< Trie
+::TrieNode >
+
+
+
+
+Node2->Node1
+ m_root
+
+
+
+Node3
+
+Trie::TrieNode
+
+
+
+
+Node2->Node3
+ character
+
+
+
+Node3->Node2
+ ptr
+
+
+
diff --git a/d8/d6c/line__segment__intersection_8cpp.html b/d8/d6c/line__segment__intersection_8cpp.html
new file mode 100644
index 000000000..0715e49f0
--- /dev/null
+++ b/d8/d6c/line__segment__intersection_8cpp.html
@@ -0,0 +1,183 @@
+
+
+
+Algorithms_in_C++: geometry/line_segment_intersection.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
check whether two line segments intersect each other or not.
+More...
+
#include <algorithm>#include <iostream>
+
+
check whether two line segments intersect each other or not.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
This is the main function to test whether the algorithm is working well.
+
+
+
94 Point first_point, second_point, third_point, forth_point;
+
+
96 std::cin >> first_point.x >> first_point.
y ;
+
97 std::cin >> second_point.x >> second_point.
y ;
+
98 std::cin >> third_point.x >> third_point.
y ;
+
99 std::cin >> forth_point.x >> forth_point.
y ;
+
+
101 printf (
"%d" , segment.intersect(first_point, second_point, third_point,
+
+
+
+
+
+
+
+
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
Definition: line_segment_intersection.cpp:22
Definition: line_segment_intersection.cpp:12
+
diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..86a68ba5f
--- /dev/null
+++ b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+7b66b13cd9e906646a781de5e20f13d9
\ 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
new file mode 100644
index 000000000..01ecc6aea
--- /dev/null
+++ b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html
new file mode 100644
index 000000000..7a3448d75
--- /dev/null
+++ b/d8/d77/namespacemachine__learning.html
@@ -0,0 +1,626 @@
+
+
+
+Algorithms_in_C++: machine_learning Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Machine learning algorithms.
+More...
+
+int save_u_matrix (const char *fname, const std::vector < std::vector < std::valarray < double >>> &W) double update_weights (const std::valarray < double > &X, std::vector < std::vector < std::valarray < double >>> *W, std::vector < std::valarray < double >> *D, double alpha, int R) void kohonen_som (const std::vector < std::valarray < double >> &X, std::vector < std::vector < std::valarray < double >>> *W, double alpha_min) void update_weights (const std::valarray < double > &x, std::vector < std::valarray < double >> *W, std::valarray < double > *D, double alpha, int R) void kohonen_som_tracer (const std::vector < std::valarray < double >> &X, std::vector < std::valarray < double >> *W, double alpha_min)
+
+
Machine learning algorithms.
+
+
+
◆
+
+
+
+
Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.
+
Parameters
+
+ [in] X data set [in,out] W weights matrix [in] alpha_min terminal value of alpha
+
+
+
+
262 int num_samples = X.
size ();
+
263 int num_features = X[0].
size ();
+
264 int num_out = W->
size ();
+
265 int R = num_out >> 2, iter = 0;
+
+
+
+
269 for (
int i = 0; i < num_out; i++) D[i] = std::valarray<double>(num_out);
+
+
+
272 double past_dmin = 1.f;
+
273 double dmin_ratio = 1.f;
+
+
+
276 for (; alpha > 0 && dmin_ratio > 1e-5; alpha -= 1e-4, iter++) {
+
+
278 for (
int sample = 0; sample < num_samples; sample++) {
+
+
+
+
+
+
284 if (iter % 300 == 0 && R > 1)
+
+
+
+
+
+
290 dmin_ratio = (past_dmin - dmin) / past_dmin;
+
+
+
+
+
295 std::cout <<
"iter: " << iter <<
"\t alpha: " << alpha <<
"\t R: " << R
+
296 <<
"\t d_min: " << dmin_ratio <<
"\r" ;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.
+
Parameters
+
+ [in] X data set [in,out] W weights matrix [in] alpha_min terminal value of alpha
+
+
+
+
148 int num_samples = X.
size ();
+
149 int num_features = X[0].
size ();
+
150 int num_out = W->
size ();
+
151 int R = num_out >> 2, iter = 0;
+
+
+
+
+
+
157 for (; alpha > alpha_min; alpha -= 0.01, iter++) {
+
+
159 for (
int sample = 0; sample < num_samples; sample++) {
+
+
+
+
+
+
165 if (iter % 10 == 0 && R > 1)
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Create the distance matrix or U-matrix from the trained 3D weiths matrix and save to disk.
+
Parameters
+
+ [in] fname filename to save in (gets overwriten without confirmation) [in] W model matrix to save
+
+
+
Returns 0 if all ok
+
+-1 if file creation failed
+
+
+
+
+
+
+
+
+
+
+
+
+
146 for (
int i = 0; i < W.
size (); i++) {
+
147 for (
int j = 0; j < W[0].
size (); j++) {
+
+
+
150 int from_x = std::max<int>(0, i - R);
+
151 int to_x = std::min<int>(W.
size (), i + R + 1);
+
152 int from_y = std::max<int>(0, j - R);
+
153 int to_y = std::min<int>(W[0].size(), j + R + 1);
+
+
+
156 #pragma omp parallel for reduction(+ : distance)
+
+
158 for (l = from_x; l < to_x; l++) {
+
159 for (m = from_y; m < to_y; m++) {
+
160 auto d = W[i][j] - W[l][m];
+
+
+
+
+
+
+
+
+
169 if (j < W[0].size() - 1) {
+
+
+
+
173 if (i < W.
size () - 1)
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
Update weights of the SOM using Kohonen algorithm
+
Parameters
+
+ [in] X data point [in,out] W weights matrix [in,out] D temporary vector to store distances [in] alpha learning rate \(0<\alpha\le1\) [in] R neighborhood range
+
+
+
+
+
104 int num_out = W->
size ();
+
105 int num_features = x.size();
+
+
+
+
+
+
111 for (j = 0; j < num_out; j++) {
+
+
+
114 (*D)[j] = (((*W)[j] - x) * ((*W)[j] - x)).sum();
+
+
+
+
+
+
120 double d_min = *result;
+
+
+
+
124 int from_node =
std::max (0, d_min_idx - R);
+
125 int to_node =
std::min (num_out, d_min_idx + R + 1);
+
+
+
+
+
+
+
132 for (j = from_node; j < to_node; j++)
+
+
134 (*W)[j] += alpha * (x - (*W)[j]);
+
+
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
Update weights of the SOM using Kohonen algorithm
+
Parameters
+
+ [in] X data point - N features [in,out] W weights matrix - PxQxN [in,out] D temporary vector to store distances PxQ [in] alpha learning rate \(0<\alpha\le1\) [in] R neighborhood range
+
+
+
Returns minimum distance of sample and trained weights
+
+
+
196 int num_out_x =
static_cast< int > (W->
size ());
+
197 int num_out_y =
static_cast< int > (W[0][0].
size ());
+
198 int num_features =
static_cast< int > (W[0][0][0].
size ());
+
+
+
+
+
+
+
205 for (x = 0; x < num_out_x; x++) {
+
206 for (y = 0; y < num_out_y; y++) {
+
+
+
+
210 auto d = ((*W)[x][y] - X);
+
211 (*D)[x][y] = (d * d).sum();
+
+
+
+
+
+
+
218 int d_min_x, d_min_y;
+
+
+
+
222 int from_x =
std::max (0, d_min_x - R);
+
223 int to_x =
std::min (num_out_x, d_min_x + R + 1);
+
224 int from_y =
std::max (0, d_min_y - R);
+
225 int to_y =
std::min (num_out_y, d_min_y + R + 1);
+
+
+
+
+
+
+
232 for (x = from_x; x < to_x; x++) {
+
233 for (y = from_y; y < to_y; y++) {
+
+
+
+
+
+
+
+
+
242 (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);
+
243 double scale_factor =
std::exp (-d2 / (2.
f * alpha * alpha));
+
+
245 (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;
+
+
+
+
+
+
+
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
void update_weights(const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)
Definition: kohonen_som_trace.cpp:100
double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
Definition: kohonen_som_topology.cpp:191
void get_min_2d(const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
Definition: kohonen_som_topology.cpp:97
ll k
Definition: matrix_exponentiation.cpp:48
+
diff --git a/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5
new file mode 100644
index 000000000..029a8d809
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5
@@ -0,0 +1 @@
+45183b2b0fef8fa06469ab0e321c628d
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg
new file mode 100644
index 000000000..6a1eda3a9
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+machine_learning::save_u_matrix
+
+Node1
+
+machine_learning::save
+_u_matrix
+
+
+
+
+Node2
+
+std::ofstream::close
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::perror
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::pow
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::snprintf
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map
new file mode 100644
index 000000000..38eb4c37b
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5
new file mode 100644
index 000000000..13cd9ef9c
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5
@@ -0,0 +1 @@
+ed493e1a4a07814d02bc38c450f202a4
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg
new file mode 100644
index 000000000..72182376a
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg
@@ -0,0 +1,113 @@
+
+
+
+
+
+
+machine_learning::update_weights
+
+Node1
+
+machine_learning::update
+_weights
+
+
+
+
+Node2
+
+std::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::distance
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::end
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::max
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::min
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::min_element
+
+
+
+
+Node1->Node7
+
+
+
diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map
new file mode 100644
index 000000000..e401ec294
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map
@@ -0,0 +1,12 @@
+
+
diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5
new file mode 100644
index 000000000..990c858cf
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5
@@ -0,0 +1 @@
+745cd27ee4af204db9bd55e95dbe0829
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg
new file mode 100644
index 000000000..dcecabb24
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg
@@ -0,0 +1,158 @@
+
+
+
+
+
+
+machine_learning::update_weights
+
+Node1
+
+machine_learning::update
+_weights
+
+
+
+
+Node2
+
+std::exp
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+get_min_2d
+
+
+
+
+Node1->Node3
+
+
+
+Node8
+
+std::max
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+std::min
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+std::sqrt
+
+
+
+
+Node1->Node10
+
+
+
+Node4
+
+std::begin
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::distance
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+std::end
+
+
+
+
+Node3->Node6
+
+
+
+Node7
+
+std::min_element
+
+
+
+
+Node3->Node7
+
+
+
diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map
new file mode 100644
index 000000000..b44f92931
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5
new file mode 100644
index 000000000..a7fee8189
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5
@@ -0,0 +1 @@
+cce5a96e39b75c6843cbd82344be3fa3
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg
new file mode 100644
index 000000000..84234f758
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg
@@ -0,0 +1,262 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning::kohonen_som_tracer
+
+Node1
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node2
+
+machine_learning::update
+_weights
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exp
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+get_min_2d
+
+
+
+
+Node2->Node4
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::min
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+std::sqrt
+
+
+
+
+Node2->Node11
+
+
+
+Node5
+
+std::begin
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::distance
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+std::end
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::min_element
+
+
+
+
+Node4->Node8
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg
new file mode 100644
index 000000000..1efe4207d
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg
@@ -0,0 +1,174 @@
+
+
+
+
+
+
+machine_learning::kohonen_som_tracer
+
+Node1
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node2
+
+machine_learning::update
+_weights
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exp
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+get_min_2d
+
+
+
+
+Node2->Node4
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::min
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+std::sqrt
+
+
+
+
+Node2->Node11
+
+
+
+Node5
+
+std::begin
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::distance
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+std::end
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::min_element
+
+
+
+
+Node4->Node8
+
+
+
diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map
new file mode 100644
index 000000000..78137ffac
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map
@@ -0,0 +1,13 @@
+
+
diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5
new file mode 100644
index 000000000..c0d7c2599
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5
@@ -0,0 +1 @@
+a59dc7902a4c1fd45aae7ab506a40101
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg
new file mode 100644
index 000000000..a22cd6273
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg
@@ -0,0 +1,261 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+machine_learning::kohonen_som
+
+Node1
+
+machine_learning::kohonen_som
+
+
+
+
+Node2
+
+machine_learning::update
+_weights
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exp
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+get_min_2d
+
+
+
+
+Node2->Node4
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::min
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+std::sqrt
+
+
+
+
+Node2->Node11
+
+
+
+Node5
+
+std::begin
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::distance
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+std::end
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::min_element
+
+
+
+
+Node4->Node8
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg
new file mode 100644
index 000000000..6ff953295
--- /dev/null
+++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg
@@ -0,0 +1,173 @@
+
+
+
+
+
+
+machine_learning::kohonen_som
+
+Node1
+
+machine_learning::kohonen_som
+
+
+
+
+Node2
+
+machine_learning::update
+_weights
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exp
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+get_min_2d
+
+
+
+
+Node2->Node4
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::min
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+std::sqrt
+
+
+
+
+Node2->Node11
+
+
+
+Node5
+
+std::begin
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::distance
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+std::end
+
+
+
+
+Node4->Node7
+
+
+
+Node8
+
+std::min_element
+
+
+
+
+Node4->Node8
+
+
+
diff --git a/d8/d8a/exponential__search_8cpp.html b/d8/d8a/exponential__search_8cpp.html
new file mode 100644
index 000000000..de13c68ef
--- /dev/null
+++ b/d8/d8a/exponential__search_8cpp.html
@@ -0,0 +1,304 @@
+
+
+
+Algorithms_in_C++: search/exponential_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Exponential search algorithm
+More...
+
#include <cassert>#include <cmath>#include <iostream>#include <cstring>
+template<class Type > Type * binary_s (Type *array, size_t size, Type key) template<class Type > Type * struzik_search (Type *array, size_t size, Type key) int main ()
+
+
Exponential search algorithm
+
Copyright 2020 Divide-et-impera-11
+
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.
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+
+
+
+ Type* binary_s
+ (
+ Type *
+ array ,
+
+ size_t
+ size ,
+
+ Type
+ key
+
+ )
+
+
+
+
+inline
+
+
+
+
Binary Search Algorithm (used by struzik_search )
+Time Complexity O(log n) where 'n' is the number of elements
+Worst Time Complexity O(log n)
+Best Time Complexity Ω(1)
+Space Complexity O(1)
+Auxiliary Space Complexity O(1) Returns pointer to value in the array
+
+nullptr if value not found
+
+
+
35 int32_t lower_index(0), upper_index(size - 1), middle_index;
+
+
37 while (lower_index <= upper_index) {
+
38 middle_index =
std::floor ((lower_index + upper_index) / 2);
+
+
40 if (*(array + middle_index) < key)
+
41 lower_index = (middle_index + 1);
+
42 else if (*(array + middle_index) > key)
+
43 upper_index = (middle_index - 1);
+
+
45 return (array + middle_index);
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
76 int * sorted_array =
new int [7]{7, 10, 15, 23, 70, 105, 203};
+
77 assert(struzik_search<int>(sorted_array, 7, 0) ==
nullptr );
+
78 assert(struzik_search<int>(sorted_array, 7, 1000) ==
nullptr );
+
79 assert(struzik_search<int>(sorted_array, 7, 50) ==
nullptr );
+
80 assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array);
+
+
82 delete [] sorted_array;
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class Type >
+
+
+ Type* struzik_search
+ (
+ Type *
+ array ,
+
+ size_t
+ size ,
+
+ Type
+ key
+
+ )
+
+
+
+
Struzik Search Algorithm(Exponential)
+Time Complexity O(log i) where i is the position of search key in the list
+Worst Time Complexity O(log i)
+Best Time Complexity Ω(1)
+Space Complexity O(1)
+Auxiliary Space Complexity O(1)
+
+
+
60 uint32_t block_front(0), block_size = size == 0 ? 0 : 1;
+
61 while (block_front != block_size) {
+
62 if (*(array + block_size - 1) < key) {
+
63 block_front = block_size;
+
64 (block_size * 2 - 1 < size) ? (block_size *= 2) : block_size = size;
+
+
+
67 return binary_s<Type>(array + block_front, (block_size - block_front),
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5
new file mode 100644
index 000000000..d6913869c
--- /dev/null
+++ b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5
@@ -0,0 +1 @@
+425710bf52e8fe2151fcea2c313b3694
\ No newline at end of file
diff --git a/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg
new file mode 100644
index 000000000..594c60ace
--- /dev/null
+++ b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+binary_s
+
+Node1
+
+binary_s
+
+
+
+
+Node2
+
+std::floor
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html
new file mode 100644
index 000000000..17c7612b2
--- /dev/null
+++ b/d8/d8e/struct_node-members.html
@@ -0,0 +1,117 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Node , including all inherited members.
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for graph , including all inherited members.
+
+
Algorithms_in_C++: statistics::stats_computer2< T > Class Template Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+n = 0 mu = 0 var = 0 M = 0
+
+
template<typename T>
+
+
continuous mean and variance computance using Welford's algorithm (very accurate)
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return sample mean computed till last sample
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Constructor
Parameters
+
+
+
+
+
+
79 double delta = x - mu;
+
+
81 double delta2 = x - mu;
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return sample standard deviation computed till last sample
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
return data variance computed till last sample
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
short-hand operator to read new sample from input stream std::cin >> stats1;
+
+
+
+
The documentation for this class was generated from the following file:
+
+
double variance() const
Definition: realtime_stats.cpp:89
void new_val(T x)
Definition: realtime_stats.cpp:77
+
diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5
new file mode 100644
index 000000000..7471fbbba
--- /dev/null
+++ b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5
@@ -0,0 +1 @@
+3b0c87070f2a479b0ed844a0d90ef929
\ 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
new file mode 100644
index 000000000..f72c1d80d
--- /dev/null
+++ b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+statistics::stats_computer2::std
+
+Node1
+
+statistics::stats_computer2::std
+
+
+
+
+Node2
+
+std::sqrt
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+statistics::stats_computer2
+::variance
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d8/db9/structcompare-members.html b/d8/db9/structcompare-members.html
new file mode 100644
index 000000000..9e6340fa5
--- /dev/null
+++ b/d8/db9/structcompare-members.html
@@ -0,0 +1,112 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for compare , including all inherited members.
+
+ operator() (MinHeapNode *l, MinHeapNode *r) (defined in compare )compare inline
+
Algorithms_in_C++: Point Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Point (double a =0.f , double b=0.f )
+x y Point respect to x coordinate. double x double y
+
+
Define a Point .
+
Define a point
+
+
+
◆
+
+
+
+
+
+
+
+
+ Point::Point
+ (
+ double
+ a = 0.f ,
+
+ double
+ b = 0.f
+
+ )
+
+
+
+
+inline explicit
+
+
+
+
construct a point
Parameters
+
+ [in] a absicca (default = 0.0) [in] b ordinate (default = 0.0)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The documentation for this struct was generated from the following files:
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
vector< ll > a
Definition: matrix_exponentiation.cpp:53
Algorithms_in_C++: std Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
STL namespace.
+More...
+
+
+
+
Algorithms_in_C++: math/sieve_of_eratosthenes.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main).
+More...
+
#include <iostream>
+#define MAX 10000000
+
+
Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main).
+
Time Complexity : \(O(N \cdot\log N)\)
+
See also primes_up_to_billion.cpp prime_numbers.cpp
+
+
+
◆
+
+
+
+
+
+ #define MAX 10000000
+
+
+
+
Maximum number of primes
+
+
+
+
+
+
◆
+
+
+
+
+
+ void init
+ (
+ )
+
+
+
+
Initialize the array
+
+
53 for (uint32_t i = 1; i <
MAX ; i++) {
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
◆
+
+
+
+
+
+ void print
+ (
+ uint32_t
+ N )
+
+
+
+
This function prints out the primes to STDOUT
+
+
41 for (uint32_t i = 1; i <= N; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void sieve
+ (
+ uint32_t
+ N )
+
+
+
+
This is the function that finds the primes and eliminates the multiples.
+
+
+
+
28 for (uint32_t i = 2; i <= N; i++) {
+
+
30 for (uint32_t j = (i << 1); j <= N; j += i) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool isprime[MAX ]
+
+
+
+
array to store the primes
+
+
+
+
+
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
void init()
Definition: sieve_of_eratosthenes.cpp:52
void sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:25
#define MAX
Definition: sieve_of_eratosthenes.cpp:16
bool isprime[MAX]
Definition: sieve_of_eratosthenes.cpp:19
+
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..61a54470b
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+20f3afa0e5ef765cc0fe353ecbbc11e9
\ 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
new file mode 100644
index 000000000..4d55310fb
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+init
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+print
+
+
+
+
+Node1->Node3
+
+
+
+Node5
+
+sieve
+
+
+
+
+Node1->Node5
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map
new file mode 100644
index 000000000..615c8eacf
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5
new file mode 100644
index 000000000..993be0a37
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5
@@ -0,0 +1 @@
+378023a270fb78cab268e7031a2dcf23
\ No newline at end of file
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg
new file mode 100644
index 000000000..a4f589da6
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+print
+
+Node1
+
+print
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/dee/avltree_8cpp.html b/d8/dee/avltree_8cpp.html
new file mode 100644
index 000000000..4f228eedd
--- /dev/null
+++ b/d8/dee/avltree_8cpp.html
@@ -0,0 +1,736 @@
+
+
+
+Algorithms_in_C++: data_structures/avltree.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A simple tree implementation using nodes.
+More...
+
#include <algorithm>#include <iostream>#include <queue>
+node node
+
+
A simple tree implementation using nodes.
+
Todo: update code to use C++ STL library features and OO structure
+
Warning This program is a poor implementation and does not utilize any of the C++ STL features.
+
+
+
◆
+
+
+
+
+
+ node * createNode (
+ int
+ data )
+
+
+
+
Create and return a new Node
+
+
+
+
+
◆
+
+
+
+
+
+ node * deleteNode (
+ node * root ,
+
+ int
+ key
+
+ )
+
+
+
+
Balanced Deletion
+
+
+
+
+
+
93 else if (key > root->
data )
+
+
+
+
+
+
99 node *temp = root->left;
+
+
+
+
103 }
else if (!root->left) {
+
104 node *temp = root->right;
+
+
+
+
+
+
+
111 root->
data = temp->data;
+
112 root->right =
deleteNode (root->right, temp->data);
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int getBalance
+ (
+ node * root )
+
+
+
+
Returns difference between height of left and right subtree
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int height
+ (
+ node * root )
+
+
+
+
Returns height of tree
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ node * insert (
+ node * root ,
+
+ int
+ item
+
+ )
+
+
+
+
Balanced Insertion
+
+
+
+
+
70 if (item < root->
data )
+
71 root->left =
insert (root->left, item);
+
+
73 root->right =
insert (root->right, item);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ node * leftRotate (
+ node * root )
+
+
+
+
Returns Node after Left Rotation
+
+
51 node *t = root->right;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void levelOrder
+ (
+ node * root )
+
+
+
+
LevelOrder (Breadth First Search)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
138 for (i = 1; i <= 7; i++) root =
insert (root, i);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ node * minValue (
+ node * root )
+
+
+
+
Returns node with minimum value in the tree
+
+
60 if (root->left == NULL)
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ node * rightRotate (
+ node * root )
+
+
+
+
Returns Node after Right Rotation
+
+
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
int main()
Definition: knuth_morris_pratt.cpp:76
void ternary_search(int N, int A[], int target)
Definition: ternary_search.cpp:127
void test3()
Definition: smallest_circle.cpp:188
int main(void)
Definition: decimal_to_hexadecimal.cpp:11
void method2(int number)
Definition: decimal_to_binary.cpp:27
int main()
Definition: exponential_search.cpp:74
int main()
Definition: stairs_pattern.cpp:17
int hash_search(int key, int *counter)
Definition: hash_search.cpp:76
void shell_sort(T *arr, size_t LEN)
Definition: shell_sort2.cpp:45
std::string tolowerRoman(int n)
Definition: decimal_to_roman_numeral.cpp:24
void test_f(const int NUM_DATA)
Definition: shell_sort2.cpp:145
String search algorithms.
Definition: brute_force_string_searching.cpp:13
void show_data(T *arr, size_t LEN)
Definition: shell_sort2.cpp:18
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
int main()
Definition: binomial_dist.cpp:84
double addition_rule_dependent(double A, double B, double B_given_A)
Definition: addition_rule.cpp:25
void test2()
Definition: smallest_circle.cpp:173
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
double x
Definition: smallest_circle.cpp:16
int main()
Definition: decimal_to_roman_numeral.cpp:90
#define absolutePrecision
Definition: ternary_search.cpp:22
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
#define HASHMAX
Determines the length of the hash table.
Definition: hash_search.cpp:22
#define PRIME
Prime modulus for hash functions.
Definition: rabin_karp.cpp:16
int partition(int arr[], int low, int high)
Definition: quick_sort.cpp:37
Type * binary_s(Type *array, size_t size, Type key)
Definition: exponential_search.cpp:34
Definition: avltree.cpp:13
double y
Definition: smallest_circle.cpp:17
#define MAX
Determines how much data.
Definition: hash_search.cpp:21
int main()
Definition: pascal_triangle.cpp:52
int main()
Definition: bayes_theorem.cpp:26
vector< vector< ll > > multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B)
Definition: matrix_exponentiation.cpp:60
int main(void)
Definition: qr_decomposition.cpp:23
int main()
Definition: palindrome_of_number.cpp:19
Sorting algorithms.
Definition: non_recursive_merge_sort.cpp:11
void levelOrder(node *root)
Definition: avltree.cpp:119
int main()
Definition: vector_important_functions.cpp:11
void merge(Iterator, Iterator, const Iterator, char[])
merges 2 sorted adjacent segments into a larger sorted segment
Definition: non_recursive_merge_sort.cpp:57
int main()
Definition: linear_search.cpp:27
static float eqd(float y)
Definition: successive_approximation.cpp:17
std::string fill(char c, int n)
Definition: decimal_to_roman_numeral.cpp:15
void mat_mul(const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT)
Definition: qr_eigen_values.cpp:54
int64_t create_hash(const std::string &s, int n)
Definition: rabin_karp.cpp:25
int main(int argc, char *argv[])
Definition: shell_sort2.cpp:183
int main()
Definition: interpolation_search2.cpp:32
int compare(const void *a, const void *b)
Definition: shell_sort2.cpp:87
int brute_force(const std::string &text, const std::string &pattern)
Definition: brute_force_string_searching.cpp:21
int main()
Definition: buzz_number.cpp:9
Functions to compute QR decomposition of any rectangular matrix.
void create_matrix(std::valarray< std::valarray< double >> *A)
Definition: qr_eigen_values.cpp:28
int main()
Definition: happy_number.cpp:29
int main()
Definition: text_search.cpp:15
const std::vector< std::vector< std::string > > test_set
Definition: brute_force_string_searching.cpp:41
int rec_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:90
Definition: linkedlist_implentation_usingarray.cpp:14
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
std::valarray< double > eigen_values(std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
Definition: qr_eigen_values.cpp:98
int64_t recalculate_hash(const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
Definition: rabin_karp.cpp:42
int main()
Definition: smallest_circle.cpp:198
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
void test_int(const int NUM_DATA)
Definition: shell_sort2.cpp:105
node * createNode(int data)
Definition: avltree.cpp:21
int ** pascal_triangle(int **arr, int n)
Definition: pascal_triangle.cpp:36
node * insert(node *root, int item)
Definition: avltree.cpp:66
int main()
Definition: matrix_exponentiation.cpp:129
Library functions to compute QR decomposition of a given matrix.
int h(int key)
Definition: hash_search.cpp:45
void non_recursive_merge_sort(const Iterator first, const Iterator last)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:86
int main(int argc, char const *argv[])
Definition: binary_search.cpp:31
ll k
Definition: matrix_exponentiation.cpp:48
Definition: tower_of_hanoi.cpp:11
#define _target
Definition: ternary_search.cpp:27
int binary_search(int a[], int r, int key)
Definition: binary_search.cpp:15
char opening(char ch)
Definition: paranthesis_matching.cpp:36
bool is_happy(T n)
Definition: happy_number.cpp:14
bool check_if_equal(const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
Definition: rabin_karp.cpp:60
int main()
Definition: ternary_search.cpp:134
double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
Definition: binomial_dist.cpp:74
double LenghtLine(const Point &A, const Point &B)
Definition: smallest_circle.cpp:37
bool kmp(const std::string &pattern, const std::string &text)
Definition: knuth_morris_pratt.cpp:56
double poisson_range_successes(double expected, double lower, double upper)
Definition: poisson_dist.cpp:54
int main()
Definition: tower_of_hanoi.cpp:65
void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:25
#define ll
Definition: matrix_exponentiation.cpp:33
double binomial_standard_deviation(double n, double p)
Definition: binomial_dist.cpp:36
int height(node *root)
Definition: avltree.cpp:31
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition: smallest_circle.cpp:54
int main()
Definition: brute_force_string_searching.cpp:47
node * rightRotate(node *root)
Definition: avltree.cpp:41
double binomial_x_successes(double n, double p, double x)
Definition: binomial_dist.cpp:65
void test2()
Definition: qr_eigen_values.cpp:210
#define endl
Definition: matrix_exponentiation.cpp:36
struct list * link
pointer to nodes
void spiralPrint(int **a, int r, int c)
Definition: spiral_print.cpp:29
double bayes_BgivenA(double AgivenB, double A, double B)
Definition: bayes_theorem.cpp:20
double poisson_rate(double events, double timeframe)
Definition: poisson_dist.cpp:17
int key
key value for node
Definition: hash_search.cpp:30
int main(int argc, char **argv)
Definition: qr_eigen_values.cpp:243
double circle(const std::vector< Point > &P)
Definition: smallest_circle.cpp:87
static float eq(float y)
Definition: successive_approximation.cpp:12
Type * struzik_search(Type *array, size_t size, Type key)
Definition: exponential_search.cpp:59
int main()
Definition: poisson_dist.cpp:65
vector< ll > a
Definition: matrix_exponentiation.cpp:53
double binomial_expected(double n, double p)
Definition: binomial_dist.cpp:22
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
int it_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:48
int jumpSearch(int arr[], int x, int n)
Definition: jump_search.cpp:12
int data[MAX]
test data
Definition: hash_search.cpp:24
void method1(int number)
Definition: decimal_to_binary.cpp:11
void test1()
Definition: qr_eigen_values.cpp:177
node * minValue(node *root)
Definition: avltree.cpp:59
int main()
Definition: hash_search.cpp:99
void create_list(int key)
Definition: hash_search.cpp:55
double fact(double x)
Definition: poisson_dist.cpp:30
double addition_rule_independent(double A, double B)
Definition: addition_rule.cpp:14
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int main()
Definition: sparse_matrix.cpp:9
void test()
Definition: smallest_circle.cpp:158
Definition: huffman.cpp:28
int main()
Definition: spiral_print.cpp:69
int main()
Definition: avltree.cpp:134
#define MAX
Definition: paranthesis_matching.cpp:16
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:79
int main()
Definition: successive_approximation.cpp:20
int LinearSearch(int *array, int size, int key)
Definition: linear_search.cpp:16
const uint64_t MAX
Definition: fibonacci_fast.cpp:24
bool IsPrime(int number)
Definition: primality_test.cpp:18
double nCr(double n, double r)
Definition: binomial_dist.cpp:47
int values[10]
Values in the tower.
Definition: tower_of_hanoi.cpp:13
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
void genArray(int **a, int r, int c)
Definition: spiral_print.cpp:12
int main()
Definition: interpolation_search.cpp:37
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
int main()
Definition: addition_rule.cpp:30
std::string toupperRoman(int n)
Definition: decimal_to_roman_numeral.cpp:58
#define LIMS
Definition: qr_eigen_values.cpp:20
double bayes_AgivenB(double BgivenA, double A, double B)
Definition: bayes_theorem.cpp:14
int main()
Definition: quick_sort.cpp:82
Point(double a=0.f, double b=0.f)
Definition: smallest_circle.cpp:23
int main()
Definition: primality_test.cpp:31
node * leftRotate(node *root)
Definition: avltree.cpp:50
struct list * next
pointer to next link in the chain
Definition: hash_search.cpp:31
int top
top tower ID
Definition: tower_of_hanoi.cpp:15
Definition: line_segment_intersection.cpp:12
void TH(int n, tower *From, tower *Using, tower *To)
Definition: tower_of_hanoi.cpp:52
int interpolation_search(int arr[], int value, int len)
Definition: interpolation_search.cpp:15
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
char pop()
pop a byte out of stack variable
Definition: paranthesis_matching.cpp:29
int InterpolationSearch(int A[], int n, int x)
Definition: interpolation_search2.cpp:15
double poisson_expected(double rate, double time)
Definition: poisson_dist.cpp:25
double poisson_x_successes(double expected, double x)
Definition: poisson_dist.cpp:46
int main(void)
Definition: rabin_karp.cpp:105
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
std::vector< int > getFailureArray(const std::string &pattern)
Definition: knuth_morris_pratt.cpp:33
void show_pascal(int **arr, int n)
Definition: pascal_triangle.cpp:18
int rabin_karp(const std::string &str, const std::string &pat)
Definition: rabin_karp.cpp:83
void get_input()
Definition: ternary_search.cpp:36
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition: smallest_circle.cpp:72
Definition: list_array.cpp:4
int getBalance(node *root)
Definition: avltree.cpp:38
double binomial_variance(double n, double p)
Definition: binomial_dist.cpp:29
ll ab(ll x)
Definition: matrix_exponentiation.cpp:43
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+
diff --git a/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5
new file mode 100644
index 000000000..c1b2ad78a
--- /dev/null
+++ b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5
@@ -0,0 +1 @@
+ab87f372bbc4be2ec5fa060b67adf4bd
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg
new file mode 100644
index 000000000..fe694ff59
--- /dev/null
+++ b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+deleteNode
+
+Node1
+
+deleteNode
+
+
+
+
+Node2
+
+std::vector::data
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+minValue
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map
new file mode 100644
index 000000000..2d94f9462
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5
new file mode 100644
index 000000000..040ad1c52
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5
@@ -0,0 +1 @@
+b583733ba8367f7a242cea7974212db7
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg
new file mode 100644
index 000000000..bd83706b5
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+insert
+
+Node1
+
+insert
+
+
+
+
+Node2
+
+createNode
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map
new file mode 100644
index 000000000..eb87cfe62
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5
new file mode 100644
index 000000000..fefb88072
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5
@@ -0,0 +1 @@
+608ec33708cee9841b33d9f36ff6bb0d
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg
new file mode 100644
index 000000000..9b134f78a
--- /dev/null
+++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+getBalance
+
+Node1
+
+getBalance
+
+
+
+
+Node2
+
+height
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::max
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map
new file mode 100644
index 000000000..e225950ab
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5
new file mode 100644
index 000000000..348a5f442
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5
@@ -0,0 +1 @@
+5d9d190cb9bb0a45e3bed989110a6a03
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg
new file mode 100644
index 000000000..ceb180cd5
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+height
+
+Node1
+
+height
+
+
+
+
+Node2
+
+std::max
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..4743445e5
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..c50c3d754
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+27e9cc3d3daf551946252ceaa155361c
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..b6b28662d
--- /dev/null
+++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+deleteNode
+
+
+
+
+Node1->Node2
+
+
+
+Node5
+
+insert
+
+
+
+
+Node1->Node5
+
+
+
+Node7
+
+levelOrder
+
+
+
+
+Node1->Node7
+
+
+
+Node3
+
+std::vector::data
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+minValue
+
+
+
+
+Node2->Node4
+
+
+
+Node6
+
+createNode
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/d9/d00/factorial_8cpp.html b/d9/d00/factorial_8cpp.html
new file mode 100644
index 000000000..0c4949054
--- /dev/null
+++ b/d9/d00/factorial_8cpp.html
@@ -0,0 +1,189 @@
+
+
+
+Algorithms_in_C++: math/factorial.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ program to find factorial of given number.
+More...
+
#include <iostream>
+
+
C++ program to find factorial of given number.
+
+
+
◆
+
+
+
+
+
+ unsigned int factorial
+ (
+ unsigned int
+ n )
+
+
+
+
function to find factorial of given number
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
unsigned int factorial(unsigned int n)
Definition: factorial.cpp:8
+
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..f849b6230
--- /dev/null
+++ b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+4cf3055aba36edc2608079f8df9c7f1e
\ No newline at end of file
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..58103d605
--- /dev/null
+++ b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+factorial
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d9/d02/linear__search_8cpp.html b/d9/d02/linear__search_8cpp.html
new file mode 100644
index 000000000..2352ce043
--- /dev/null
+++ b/d9/d02/linear__search_8cpp.html
@@ -0,0 +1,240 @@
+
+
+
+Algorithms_in_C++: search/linear_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Linear search algorithm
+More...
+
#include <iostream>
+
+
+
+
◆
+
+
+
+
+
+ int LinearSearch
+ (
+ int *
+ array ,
+
+ int
+ size ,
+
+ int
+ key
+
+ )
+
+
+
+
Algorithm implementation
Parameters
+
+ [in] array array to search in [in] size length of array [in] key key value to search for
+
+
+
Returns index where the key-value occurs in the array
+
+-1 if key-value not found
+
+
17 for (
int i = 0; i < size; ++i) {
+
18 if (array[i] == key) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
29 std::cout <<
"\nEnter the size of the Array : " ;
+
+
+
32 int *array =
new int [size];
+
+
+
+
36 std::cout <<
"\nEnter the Array of " << size <<
" numbers : " ;
+
37 for (
int i = 0; i < size; i++) {
+
+
+
+
41 std::cout <<
"\nEnter the number to be searched : " ;
+
+
+
+
+
46 std::cout <<
"\nNumber found at index : " << index;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int LinearSearch(int *array, int size, int key)
Definition: linear_search.cpp:16
+
diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..827678108
--- /dev/null
+++ b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+b48547af7712913b0051c43458c867d6
\ 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
new file mode 100644
index 000000000..d4848d4cc
--- /dev/null
+++ b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+LinearSearch
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d03/namespacestring__search.html b/d9/d03/namespacestring__search.html
new file mode 100644
index 000000000..29fbec58a
--- /dev/null
+++ b/d9/d03/namespacestring__search.html
@@ -0,0 +1,554 @@
+
+
+
+Algorithms_in_C++: string_search Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
String search algorithms.
+More...
+
+int brute_force (const std::string &text, const std::string &pattern) std::vector < int > getFailureArray (const std::string &pattern) bool kmp (const std::string &pattern, const std::string &text) int64_t create_hash (const std::string &s, int n) int64_t recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength) bool check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2) int rabin_karp (const std::string &str, const std::string &pat)
+
+
String search algorithms.
+
+
+
◆
+
+
+
+
+
+ int string_search::brute_force
+ (
+ const std::string &
+ text ,
+
+ const std::string &
+ pattern
+
+ )
+
+
+
+
Find a pattern in a string by comparing the pattern to every substring.
Parameters
+
+ text Any string that might contain the pattern. pattern String that we are searching for.
+
+
+
Returns Index where the pattern starts in the text
+
+-1 if the pattern was not found.
+
+
22 size_t pat_l = pattern.
length ();
+
23 size_t txt_l = text.
length ();
+
+
+
26 for (
size_t i = 0; i < txt_l - pat_l + 1; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool string_search::check_if_equal
+ (
+ const std::string &
+ str1 ,
+
+ const std::string &
+ str2 ,
+
+ int
+ start1 ,
+
+ int
+ end1 ,
+
+ int
+ start2 ,
+
+ int
+ end2
+
+ )
+
+
+
+
compare if two sub-strings are equal
Parameters
+
+ [in] str1 string pattern to search [in] str2 text in which to search [in] start1,end1 start and end indices for substring in str1 [in] start2,end2 start and end indices for substring in str2
+
+
+
Returns true if pattern was found
+false if pattern was not found
+
Note can this be replaced by std::string::compare ?
+
+
62 if (end1 - start1 != end2 - start2) {
+
+
+
65 while (start1 <= end1 && start2 <= end2) {
+
66 if (str1[start1] != str2[start2]) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int64_t string_search::create_hash
+ (
+ const std::string &
+ s ,
+
+ int
+ n
+
+ )
+
+
+
+
convert a string to an intger - called as hashing function
Parameters
+
+ [in] s source of string to hash [in] n length of substring to hash
+
+
+
Returns hash integer
+
+
+
27 for (
int i = 0; i < n; ++i) {
+
28 result += (int64_t)(s[i] * (int64_t)
pow (
PRIME , i));
+
+
+
+
+
+
+
+
◆
+
+
+
+
Generate the partial match table aka failure function for a pattern to search.
Parameters
+
+ [in] pattern text for which to create the partial match table
+
+
+
Returns the partial match table as a vector array
+
+
34 int pattern_length = pattern.
size ();
+
+
+
+
+
39 for (
int i = 0; i < pattern_length; i++) {
+
40 while (j != -1 && pattern[j] != pattern[i]) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool string_search::kmp
+ (
+ const std::string &
+ pattern ,
+
+ const std::string &
+ text
+
+ )
+
+
+
+
KMP algorithm to find a pattern in a text
Parameters
+
+ [in] pattern string pattern to search [in] text text in which to search
+
+
+
Returns true if pattern was found
+false if pattern was not found
+
+
57 int text_length = text.
size (), pattern_length = pattern.
size ();
+
+
+
+
61 for (
int j = 0; j < text_length; j++) {
+
62 while (
k != -1 && pattern[
k ] != text[j]) {
+
+
+
+
66 if (
k == pattern_length)
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int string_search::rabin_karp
+ (
+ const std::string &
+ str ,
+
+ const std::string &
+ pat
+
+ )
+
+
+
+
Perform string pattern search using Rabin-Karp algorithm
Parameters
+
+ [in] str string to search in [in] pat pattern to search for
+
+
+
Returns index of first occurrence of pattern
+
+-1 if pattern not found
+
+
+
+
86 for (
int i = 0; i <= str.
size () - pat.
size (); ++i) {
+
87 if (pat_hash == str_hash &&
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int64_t string_search::recalculate_hash
+ (
+ const std::string &
+ s ,
+
+ int
+ old_index ,
+
+ int
+ new_index ,
+
+ int64_t
+ old_hash ,
+
+ int
+ patLength
+
+ )
+
+
+
+
re-hash a string using known existing hash
Parameters
+
+ [in] s source of string to hash [in] old_index previous index of string [in] new_index new index of string [in] old_hash previous hash of substring [in] patLength length of substring to hash
+
+
+
Returns new hash integer
+
+
44 int64_t new_hash = old_hash - s[old_index];
+
+
46 new_hash += (int64_t)(s[new_index] * (int64_t)
pow (
PRIME , patLength - 1));
+
+
+
+
+
+
+
#define PRIME
Prime modulus for hash functions.
Definition: rabin_karp.cpp:16
int64_t create_hash(const std::string &s, int n)
Definition: rabin_karp.cpp:25
int64_t recalculate_hash(const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
Definition: rabin_karp.cpp:42
ll k
Definition: matrix_exponentiation.cpp:48
bool check_if_equal(const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
Definition: rabin_karp.cpp:60
std::vector< int > getFailureArray(const std::string &pattern)
Definition: knuth_morris_pratt.cpp:33
+
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5
new file mode 100644
index 000000000..377758e0f
--- /dev/null
+++ b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5
@@ -0,0 +1 @@
+6f4b42633378ecdfb7d5963098281228
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg
new file mode 100644
index 000000000..7b4fd131c
--- /dev/null
+++ b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+string_search::rabin_karp
+
+Node1
+
+string_search::rabin_karp
+
+
+
+
+Node2
+
+string_search::check
+_if_equal
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+string_search::create_hash
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+string_search::recalculate_hash
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::string::size
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map
new file mode 100644
index 000000000..2cbf3ca69
--- /dev/null
+++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5
new file mode 100644
index 000000000..30ba36175
--- /dev/null
+++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5
@@ -0,0 +1 @@
+8fa29a706e4eac747a1be68c37082dd9
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg
new file mode 100644
index 000000000..b43e97d8c
--- /dev/null
+++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+string_search::kmp
+
+Node1
+
+string_search::kmp
+
+
+
+
+Node2
+
+string_search::getFailure
+Array
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::string::size
+
+
+
+
+Node1->Node3
+
+
+
+Node2->Node3
+
+
+
diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map
new file mode 100644
index 000000000..5fe5a63d6
--- /dev/null
+++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5
new file mode 100644
index 000000000..726a28a5d
--- /dev/null
+++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5
@@ -0,0 +1 @@
+4f1b0be0f8b16f31249a7add179e9be1
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg
new file mode 100644
index 000000000..28bc6cb4c
--- /dev/null
+++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+string_search::getFailureArray
+
+Node1
+
+string_search::getFailure
+Array
+
+
+
+
+Node2
+
+std::string::size
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map
new file mode 100644
index 000000000..892362439
--- /dev/null
+++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5
new file mode 100644
index 000000000..1e10cdff2
--- /dev/null
+++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5
@@ -0,0 +1 @@
+47972070030315373c4de0ef1d34afa3
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg
new file mode 100644
index 000000000..4cec68fdf
--- /dev/null
+++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+string_search::brute_force
+
+Node1
+
+string_search::brute
+_force
+
+
+
+
+Node2
+
+std::string::length
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::string::substr
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d9/d1d/structqueue-members.html b/d9/d1d/structqueue-members.html
new file mode 100644
index 000000000..2b85546a2
--- /dev/null
+++ b/d9/d1d/structqueue-members.html
@@ -0,0 +1,125 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for queue< Kind > , including all inherited members.
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for machine_learning::adaline , including all inherited members.
+
+
Algorithms_in_C++: probability/poisson_dist.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Poisson statistics
+More...
+
#include <cmath>#include <iostream>
+
+
Poisson statistics
+
The Poisson distribution counts how many events occur over a set time interval.
+
+
+
◆
+
+
+
+
+
+ double fact
+ (
+ double
+ x )
+
+
+
+
Compute factorial of a given number
+
+
+
32 for (
int i = x - 1; i > 0; i--) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
66 double rate, expected;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double poisson_expected
+ (
+ double
+ rate ,
+
+ double
+ time
+
+ )
+
+
+
+
calculate the expected value over a time e.g rate of 2.5 over 10 mins = 2.5 x 10 = 25
+
25 {
return rate *
time ; }
+
+
+
+
+
◆
+
+
+
+
+
+ double poisson_range_successes
+ (
+ double
+ expected ,
+
+ double
+ lower ,
+
+ double
+ upper
+
+ )
+
+
+
+
probability of a success in range for Poisson dist (inclusive, inclusive)
+\[P = \sum_i p(\mu,i)\]
+
+
+
55 double probability = 0;
+
56 for (
int i = lower; i <= upper; i++) {
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ double poisson_rate
+ (
+ double
+ events ,
+
+ double
+ timeframe
+
+ )
+
+
+
+
poisson rate:
+
+
18 return events / timeframe;
+
+
+
+
+
+
◆
+
+
+
+
+
+ double poisson_x_successes
+ (
+ double
+ expected ,
+
+ double
+ x
+
+ )
+
+
+
+
Find the probability of x successes in a Poisson dist.
+\[p(\mu,x) = \frac{\mu^x e^{-\mu}}{x!}\]
+
+
+
+
+
+
+
+
double poisson_range_successes(double expected, double lower, double upper)
Definition: poisson_dist.cpp:54
double poisson_rate(double events, double timeframe)
Definition: poisson_dist.cpp:17
double fact(double x)
Definition: poisson_dist.cpp:30
double poisson_expected(double rate, double time)
Definition: poisson_dist.cpp:25
double poisson_x_successes(double expected, double x)
Definition: poisson_dist.cpp:46
+
diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5
new file mode 100644
index 000000000..6c75b52de
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5
@@ -0,0 +1 @@
+84e5ede0df4dda59b815b0445ae52411
\ 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
new file mode 100644
index 000000000..2ddbb7b7e
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+poisson_x_successes
+
+Node1
+
+poisson_x_successes
+
+
+
+
+Node2
+
+std::exp
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+fact
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::pow
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map
new file mode 100644
index 000000000..4b9815692
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5
new file mode 100644
index 000000000..045955e03
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5
@@ -0,0 +1 @@
+48caf56af767bc775b0691e488ee80d2
\ 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
new file mode 100644
index 000000000..67cfc5529
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+poisson_range_successes
+
+Node1
+
+poisson_range_successes
+
+
+
+
+Node2
+
+poisson_x_successes
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::exp
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+fact
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::pow
+
+
+
+
+Node2->Node5
+
+
+
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..af35160ed
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..d32db93e6
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+c4ffd1303f5775c61a1e19286e2fe968
\ 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
new file mode 100644
index 000000000..e9705e031
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,148 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+poisson_expected
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+poisson_range_successes
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+poisson_x_successes
+
+
+
+
+Node1->Node5
+
+
+
+Node9
+
+poisson_rate
+
+
+
+
+Node1->Node9
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::exp
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+fact
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+std::pow
+
+
+
+
+Node5->Node8
+
+
+
diff --git a/d9/d28/class_queue__coll__graph.map b/d9/d28/class_queue__coll__graph.map
new file mode 100644
index 000000000..d7c5609d9
--- /dev/null
+++ b/d9/d28/class_queue__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d28/class_queue__coll__graph.md5 b/d9/d28/class_queue__coll__graph.md5
new file mode 100644
index 000000000..517da02b7
--- /dev/null
+++ b/d9/d28/class_queue__coll__graph.md5
@@ -0,0 +1 @@
+cd13353e82c5578f9a7878594349d7b5
\ No newline at end of file
diff --git a/d9/d28/class_queue__coll__graph.svg b/d9/d28/class_queue__coll__graph.svg
new file mode 100644
index 000000000..ae3786c62
--- /dev/null
+++ b/d9/d28/class_queue__coll__graph.svg
@@ -0,0 +1,50 @@
+
+
+
+
+
+
+Queue
+
+Node1
+
+Queue
+
+
+
+
+Node2
+
+node< Kind >
+
+
+
+
+Node2->Node1
+ front
+rear
+
+
+
+Node2->Node2
+ prev
+next
+right
+left
+link
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html
new file mode 100644
index 000000000..d4c446116
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp.html
@@ -0,0 +1,662 @@
+
+
+
+Algorithms_in_C++: machine_learning/kohonen_som_trace.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Kohonen self organizing map (data tracing)
+More...
+
#include <algorithm>#include <cmath>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>#include <vector>
+double _random (double a , double b) int save_nd_data (const char *fname, const std::vector < std::valarray < double >> &X) void machine_learning::update_weights (const std::valarray < double > &x, std::vector < std::valarray < double >> *W, std::valarray < double > *D, double alpha, int R) void machine_learning::kohonen_som_tracer (const std::vector < std::valarray < double >> &X, std::vector < std::valarray < double >> *W, double alpha_min) void test_circle (std::vector < std::valarray < double >> *data ) void test1 () void test_lamniscate (std::vector < std::valarray < double >> *data ) void test2 () void test_3d_classes (std::vector < std::valarray < double >> *data ) void test3 () double get_clock_diff (clock_t start_t, clock_t end_t) int main (int argc, char **argv)
+
+
Kohonen self organizing map (data tracing)
+
This example implements a powerful self organizing map algorithm. The algorithm creates a connected network of weights that closely follows the given data points. This this creates a chain of nodes that resembles the given input shape.
+
Author Krishna Vedala
+
Note This C++ version of the program is considerable slower than its C counterpart
+
+The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows
+
See also kohonen_som_topology.cpp
+
+
+
◆
+
+
+
+
+
+ double get_clock_diff
+ (
+ clock_t
+ start_t ,
+
+ clock_t
+ end_t
+
+ )
+
+
+
+
Convert clock cycle difference to time in seconds
+
Parameters
+
+ [in] start_t start clock [in] end_t end clock
+
+
+
Returns time difference in seconds
+
+
439 return static_cast< double > (end_t - start_t) / CLOCKS_PER_SEC;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
Main function
+
+
+
445 std::cout <<
"Using OpenMP based parallelization\n" ;
+
+
447 std::cout <<
"NOT using OpenMP based parallelization\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
471 <<
"(Note: Calculated times include: creating test sets, training "
+
472 "model and writing files to disk.)\n\n" ;
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test1
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
+test1.csv: random test samples points with a circular patternw11.csv: initial random mapw12.csv: trained SOM map
+
The outputs can be readily plotted in gnuplot using the following snippet
set datafile separator ','
+
plot "test1.csv" title "original", \
+
"w11.csv" title "w1", \
+
"w12.csv" title "w2"
+
+
+
+
+
+
+
+
231 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
+
+
+
+
241 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:
+test2.csv: random test samples points with a lamniscate patternw21.csv: initial random mapw22.csv: trained SOM map
+
The outputs can be readily plotted in gnuplot using the following snippet
set datafile separator ','
+
plot "test2.csv" title "original", \
+
"w21.csv" title "w1", \
+
"w22.csv" title "w2"
+
+
+
+
+
+
+
+
311 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
+
+
+
+
321 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test3
+ (
+ )
+
+
+
+
Test that creates a random set of points distributed in six clusters in 3D space. The following CSV files are created to validate the execution:
+test3.csv: random test samples points with a circular patternw31.csv: initial random mapw32.csv: trained SOM map
+
The outputs can be readily plotted in gnuplot using the following snippet
set datafile separator ','
+
plot "test3.csv" title "original", \
+
"w31.csv" title "w1", \
+
"w32.csv" title "w2"
+
+
+
+
+
+
+
+
408 for (
int i = 0; i <
std::max (num_out, N); i++) {
+
+
+
+
+
+
+
+
+
+
418 for (j = 0; j < features; j++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed in six clusters in 3D space with centroids at the points
+\({0.5, 0.5, 0.5}\)
+\({0.5, 0.5, -0.5}\)
+\({0.5, -0.5, 0.5}\)
+\({0.5, -0.5, -0.5}\)
+\({-0.5, 0.5, 0.5}\)
+\({-0.5, 0.5, -0.5}\)
+\({-0.5, -0.5, 0.5}\)
+\({-0.5, -0.5, -0.5}\)
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
348 const int N =
data ->size();
+
349 const double R = 0.1;
+
+
351 const int num_classes = 8;
+
352 const double centres[][3] = {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
367 for (i = 0; i < N; i++) {
+
+
+
+
+
372 data [0][i][0] =
_random (centres[cls][0] - R, centres[cls][0] + R);
+
373 data [0][i][1] =
_random (centres[cls][1] - R, centres[cls][1] + R);
+
374 data [0][i][2] =
_random (centres[cls][2] - R, centres[cls][2] + R);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The generating function is
+\begin{eqnarray*} r &\in& [1-\delta r, 1+\delta r)\\ \theta &\in& [0, 2\pi)\\ x &=& r\cos\theta\\ y &=& r\sin\theta \end{eqnarray*}
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
189 const int N =
data ->size();
+
190 const double R = 0.75, dr = 0.3;
+
191 double a_t = 0., b_t = 2.f * M_PI;
+
192 double a_r = R - dr, b_r = R + dr;
+
+
+
+
+
+
198 for (i = 0; i < N; i++) {
+
+
200 double theta =
_random (a_t, b_t);
+
201 data [0][i][0] = r *
cos (theta);
+
202 data [0][i][1] = r *
sin (theta);
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Creates a random set of points distributed near the locus of the Lamniscate of Gerono .
+\begin{eqnarray*} \delta r &=& 0.2\\ \delta x &\in& [-\delta r, \delta r)\\ \delta y &\in& [-\delta r, \delta r)\\ \theta &\in& [0, \pi)\\ x &=& \delta x + \cos\theta\\ y &=& \delta y + \frac{\sin(2\theta)}{2} \end{eqnarray*}
+
+
Parameters
+
+ [out] data matrix to store data in
+
+
+
+
268 const int N =
data ->size();
+
269 const double dr = 0.2;
+
+
+
+
+
+
275 for (i = 0; i < N; i++) {
+
+
+
278 double theta =
_random (0, M_PI);
+
279 data [0][i][0] = dx +
cos (theta);
+
280 data [0][i][1] = dy +
sin (2. * theta) / 2.f;
+
+
+
+
+
+
+
+
+
void test_3d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:347
int save_nd_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_trace.cpp:57
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_trace.cpp:438
void test1()
Definition: kohonen_som_trace.cpp:225
void test2()
Definition: kohonen_som_trace.cpp:305
void test_lamniscate(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:267
int data[MAX]
test data
Definition: hash_search.cpp:24
void test3()
Definition: kohonen_som_trace.cpp:402
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:145
void test_circle(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:188
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
new file mode 100644
index 000000000..2a80f6910
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -0,0 +1 @@
+0a4a1b543dbdbd5edcbc0f5a6f98482d
\ 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
new file mode 100644
index 000000000..7ebb9b600
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -0,0 +1,379 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_lamniscate
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
new file mode 100644
index 000000000..387bdbfb4
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -0,0 +1,291 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_lamniscate
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
new file mode 100644
index 000000000..0f06fe6d8
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
@@ -0,0 +1,20 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
new file mode 100644
index 000000000..855cd9e52
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
@@ -0,0 +1 @@
+7a30421993cdd2e6bc5eb779c6a80bed
\ 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
new file mode 100644
index 000000000..9c3073f97
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@@ -0,0 +1,379 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_circle
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
new file mode 100644
index 000000000..ce78667ad
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
@@ -0,0 +1,291 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_circle
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
new file mode 100644
index 000000000..80945d421
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
@@ -0,0 +1,30 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..8857af679
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+934891699247b65ef790f89ec18043d6
\ 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
new file mode 100644
index 000000000..8455fe10d
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,589 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+get_clock_diff
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::srand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+test1
+
+
+
+
+Node1->Node5
+
+
+
+Node23
+
+test2
+
+
+
+
+Node1->Node23
+
+
+
+Node25
+
+test3
+
+
+
+
+Node1->Node25
+
+
+
+Node28
+
+std::time
+
+
+
+
+Node1->Node28
+
+
+
+Node6
+
+_random
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node5->Node7
+
+
+
+Node15
+
+std::max
+
+
+
+
+Node5->Node15
+
+
+
+Node18
+
+save_nd_data
+
+
+
+
+Node5->Node18
+
+
+
+Node22
+
+test_circle
+
+
+
+
+Node5->Node22
+
+
+
+Node8
+
+machine_learning::update
+_weights
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::exp
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+get_min_2d
+
+
+
+
+Node8->Node10
+
+
+
+Node8->Node15
+
+
+
+Node16
+
+std::min
+
+
+
+
+Node8->Node16
+
+
+
+Node17
+
+std::sqrt
+
+
+
+
+Node8->Node17
+
+
+
+Node11
+
+std::begin
+
+
+
+
+Node10->Node11
+
+
+
+Node12
+
+std::distance
+
+
+
+
+Node10->Node12
+
+
+
+Node13
+
+std::end
+
+
+
+
+Node10->Node13
+
+
+
+Node14
+
+std::min_element
+
+
+
+
+Node10->Node14
+
+
+
+Node19
+
+std::ofstream::close
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::ofstream::is_open
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::ofstream::open
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node6
+
+
+
+Node23->Node6
+
+
+
+Node23->Node7
+
+
+
+Node23->Node15
+
+
+
+Node23->Node18
+
+
+
+Node24
+
+test_lamniscate
+
+
+
+
+Node23->Node24
+
+
+
+Node24->Node6
+
+
+
+Node25->Node6
+
+
+
+Node25->Node7
+
+
+
+Node25->Node15
+
+
+
+Node25->Node18
+
+
+
+Node26
+
+test_3d_classes
+
+
+
+
+Node25->Node26
+
+
+
+Node26->Node6
+
+
+
+Node27
+
+std::rand
+
+
+
+
+Node26->Node27
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
new file mode 100644
index 000000000..78e160481
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
@@ -0,0 +1,501 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+get_clock_diff
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::srand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+test1
+
+
+
+
+Node1->Node5
+
+
+
+Node23
+
+test2
+
+
+
+
+Node1->Node23
+
+
+
+Node25
+
+test3
+
+
+
+
+Node1->Node25
+
+
+
+Node28
+
+std::time
+
+
+
+
+Node1->Node28
+
+
+
+Node6
+
+_random
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node5->Node7
+
+
+
+Node15
+
+std::max
+
+
+
+
+Node5->Node15
+
+
+
+Node18
+
+save_nd_data
+
+
+
+
+Node5->Node18
+
+
+
+Node22
+
+test_circle
+
+
+
+
+Node5->Node22
+
+
+
+Node8
+
+machine_learning::update
+_weights
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+std::exp
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+get_min_2d
+
+
+
+
+Node8->Node10
+
+
+
+Node8->Node15
+
+
+
+Node16
+
+std::min
+
+
+
+
+Node8->Node16
+
+
+
+Node17
+
+std::sqrt
+
+
+
+
+Node8->Node17
+
+
+
+Node11
+
+std::begin
+
+
+
+
+Node10->Node11
+
+
+
+Node12
+
+std::distance
+
+
+
+
+Node10->Node12
+
+
+
+Node13
+
+std::end
+
+
+
+
+Node10->Node13
+
+
+
+Node14
+
+std::min_element
+
+
+
+
+Node10->Node14
+
+
+
+Node19
+
+std::ofstream::close
+
+
+
+
+Node18->Node19
+
+
+
+Node20
+
+std::ofstream::is_open
+
+
+
+
+Node18->Node20
+
+
+
+Node21
+
+std::ofstream::open
+
+
+
+
+Node18->Node21
+
+
+
+Node22->Node6
+
+
+
+Node23->Node6
+
+
+
+Node23->Node7
+
+
+
+Node23->Node15
+
+
+
+Node23->Node18
+
+
+
+Node24
+
+test_lamniscate
+
+
+
+
+Node23->Node24
+
+
+
+Node24->Node6
+
+
+
+Node25->Node6
+
+
+
+Node25->Node7
+
+
+
+Node25->Node15
+
+
+
+Node25->Node18
+
+
+
+Node26
+
+test_3d_classes
+
+
+
+
+Node25->Node26
+
+
+
+Node26->Node6
+
+
+
+Node27
+
+std::rand
+
+
+
+
+Node26->Node27
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map
new file mode 100644
index 000000000..cb18034e1
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5
new file mode 100644
index 000000000..8a36ae90f
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5
@@ -0,0 +1 @@
+f21bc3dcf3fe76d08d20c0134b0aa0b8
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg
new file mode 100644
index 000000000..5445f398a
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+test_lamniscate
+
+Node1
+
+test_lamniscate
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
new file mode 100644
index 000000000..f6ebb95c2
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
@@ -0,0 +1,21 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
new file mode 100644
index 000000000..840bbe505
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
@@ -0,0 +1 @@
+07f9539d1bb469553d36294b4554c5f1
\ 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
new file mode 100644
index 000000000..503416896
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
@@ -0,0 +1,394 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_3d_classes
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
+Node19
+
+std::rand
+
+
+
+
+Node18->Node19
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
new file mode 100644
index 000000000..5ab343aa7
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
@@ -0,0 +1,306 @@
+
+
+
+
+
+
+test3
+
+Node1
+
+test3
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+machine_learning::kohonen
+_som_tracer
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+std::max
+
+
+
+
+Node1->Node11
+
+
+
+Node14
+
+save_nd_data
+
+
+
+
+Node1->Node14
+
+
+
+Node18
+
+test_3d_classes
+
+
+
+
+Node1->Node18
+
+
+
+Node4
+
+machine_learning::update
+_weights
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::exp
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+get_min_2d
+
+
+
+
+Node4->Node6
+
+
+
+Node4->Node11
+
+
+
+Node12
+
+std::min
+
+
+
+
+Node4->Node12
+
+
+
+Node13
+
+std::sqrt
+
+
+
+
+Node4->Node13
+
+
+
+Node7
+
+std::begin
+
+
+
+
+Node6->Node7
+
+
+
+Node8
+
+std::distance
+
+
+
+
+Node6->Node8
+
+
+
+Node9
+
+std::end
+
+
+
+
+Node6->Node9
+
+
+
+Node10
+
+std::min_element
+
+
+
+
+Node6->Node10
+
+
+
+Node15
+
+std::ofstream::close
+
+
+
+
+Node14->Node15
+
+
+
+Node16
+
+std::ofstream::is_open
+
+
+
+
+Node14->Node16
+
+
+
+Node17
+
+std::ofstream::open
+
+
+
+
+Node14->Node17
+
+
+
+Node18->Node2
+
+
+
+Node19
+
+std::rand
+
+
+
+
+Node18->Node19
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map
new file mode 100644
index 000000000..7f6aeeb1e
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5
new file mode 100644
index 000000000..0be77521c
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5
@@ -0,0 +1 @@
+8fb2c65461ab37f7cc7449fa32a12424
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg
new file mode 100644
index 000000000..2315188e6
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+test_3d_classes
+
+Node1
+
+test_3d_classes
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map
new file mode 100644
index 000000000..f93972ef3
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5
new file mode 100644
index 000000000..e0554ea15
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5
@@ -0,0 +1 @@
+dd1ddac43d9c78c6ab8ac18ee5952db6
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg
new file mode 100644
index 000000000..daf805909
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+test_circle
+
+Node1
+
+test_circle
+
+
+
+
+Node2
+
+_random
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d57/structtrie__coll__graph.map b/d9/d57/structtrie__coll__graph.map
new file mode 100644
index 000000000..e18450df2
--- /dev/null
+++ b/d9/d57/structtrie__coll__graph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d9/d57/structtrie__coll__graph.md5 b/d9/d57/structtrie__coll__graph.md5
new file mode 100644
index 000000000..129051b4e
--- /dev/null
+++ b/d9/d57/structtrie__coll__graph.md5
@@ -0,0 +1 @@
+f502dd314fbfcefc3b2fcb099b7dfd66
\ No newline at end of file
diff --git a/d9/d57/structtrie__coll__graph.svg b/d9/d57/structtrie__coll__graph.svg
new file mode 100644
index 000000000..3d286df54
--- /dev/null
+++ b/d9/d57/structtrie__coll__graph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+trie
+
+Node1
+
+trie
+
+
+
+
+Node1->Node1
+ arr
+
+
+
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.html b/d9/d5d/extended__euclid__algorithm_8cpp.html
new file mode 100644
index 000000000..a8c5a214e
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp.html
@@ -0,0 +1,372 @@
+
+
+
+Algorithms_in_C++: math/extended_euclid_algorithm.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
GCD using extended Euclid's algorithm
+More...
+
#include <algorithm>#include <iostream>
+template<typename T , typename T2 > void update_step (T *r, T *r0, const T2 quotient) template<typename T1 , typename T2 > void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y) template<typename T , typename T2 > void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y) main () Main function.
+
+
GCD using extended Euclid's algorithm
+
Finding coefficients of a and b ie x and y in Bézout's identity
+\[\text{gcd}(a, b) = a \times x + b \times y \]
+
+
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.
+
+
+
◆
+
+
+
+
+template<typename T , typename T2 >
+
+
+ void extendedEuclid
+ (
+ T
+ A ,
+
+ T
+ B ,
+
+ T *
+ GCD ,
+
+ T2 *
+ x ,
+
+ T2 *
+ y
+
+ )
+
+
+
+
Implementation using recursive algorithm
+
Parameters
+
+ [in] A unsigned [in] B unsigned [out] GCD unsigned [in,out] x signed [in,out] y signed
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
82 *y = temp - (A / B) * (*y);
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T1 , typename T2 >
+
+
+ void extendedEuclid_1
+ (
+ T1
+ A ,
+
+ T1
+ B ,
+
+ T1 *
+ GCD ,
+
+ T2 *
+ x ,
+
+ T2 *
+ y
+
+ )
+
+
+
+
Implementation using iterative algorithm from Wikipedia
+
Parameters
+
+ [in] A unsigned [in] B unsigned [out] GCD unsigned [out] x signed [out] y signed
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T , typename T2 >
+
+
+
+
+
+ void update_step
+ (
+ T *
+ r ,
+
+ T *
+ r0 ,
+
+ const T2
+ quotient
+
+ )
+
+
+
+
+inline
+
+
+
+
function to update the coefficients per iteration
+\[r_0,\,r = r,\, r_0 - \text{quotient}\times r\]
+
+
Parameters
+
+ [in,out] r signed or unsigned [in,out] r0 signed or unsigned [in] quotient unsigned
+
+
+
+
+
26 *r = *r0 - (quotient * temp);
+
+
+
+
+
+
+
void update_step(T *r, T *r0, const T2 quotient)
Definition: extended_euclid_algorithm.cpp:24
void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:70
+
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5
new file mode 100644
index 000000000..b25b5784e
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5
@@ -0,0 +1 @@
+0b5961d519770c806e0bb949dea234cd
\ 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
new file mode 100644
index 000000000..120c0bf70
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+extendedEuclid_1
+
+Node1
+
+extendedEuclid_1
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+update_step
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map
new file mode 100644
index 000000000..6a6eb281c
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5
new file mode 100644
index 000000000..413d115e9
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5
@@ -0,0 +1 @@
+fbb11d633d8b832d543750d20c5d3cb9
\ 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
new file mode 100644
index 000000000..2d94eb533
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+extendedEuclid
+
+Node1
+
+extendedEuclid
+
+
+
+
+Node2
+
+std::swap
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d66/group__machine__learning.html b/d9/d66/group__machine__learning.html
new file mode 100644
index 000000000..9db4cc182
--- /dev/null
+++ b/d9/d66/group__machine__learning.html
@@ -0,0 +1,432 @@
+
+
+
+Algorithms_in_C++: Machine Learning Algorithms
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+MAX_ITER 500 _USE_MATH_DEFINES _USE_MATH_DEFINES
+
+
+
+
◆
+
+
+
+
+
+ double _random
+ (
+ double
+ a ,
+
+ double
+ b
+
+ )
+
+
+
+
Helper function to generate a random number in a given interval.
+r1 = rand() % 100 gets a random number between 0 and 99r2 = r1 / 100 converts random number to be between 0 and 0.99scale and offset the random number to given range of \([a,b]\)
+
+
Parameters
+
+ [in] a lower limit [in] b upper limit
+
+
+
Returns random number in the range \([a,b]\)
+
+
+
+
+
◆
+
+
+
+
+
+ void get_min_2d
+ (
+ const std::vector < std::valarray < double >> &
+ X ,
+
+ double *
+ val ,
+
+ int *
+ x_idx ,
+
+ int *
+ y_idx
+
+ )
+
+
+
+
Get minimum value and index of the value in a matrix
Parameters
+
+ [in] X matrix to search [in] N number of points in the vector [out] val minimum value found [out] idx_x x-index where minimum value was found [out] idx_y y-index where minimum value was found
+
+
+
+
+
+
+
102 for (
int i = 0; i < N; i++) {
+
+
104 double d_min = *result;
+
+
+
107 if (d_min < val[0]) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int save_2d_data
+ (
+ const char *
+ fname ,
+
+ const std::vector < std::valarray < double >> &
+ X
+
+ )
+
+
+
+
Save a given n-dimensional data martix to file.
+
Parameters
+
+ [in] fname filename to save in (gets overwriten without confirmation) [in] X matrix to save
+
+
+
Returns 0 if all ok
+
+-1 if file creation failed
+
+
62 size_t num_points = X.
size ();
+
63 size_t num_features = X[0].
size ();
+
+
+
+
+
+
69 std::cerr <<
"Error opening file " << fname <<
"\n" ;
+
+
+
+
+
74 for (
int i = 0; i < num_points; i++) {
+
+
76 for (
int j = 0; j < num_features; j++) {
+
+
78 if (j < num_features - 1)
+
+
+
81 if (i < num_points - 1)
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int save_nd_data
+ (
+ const char *
+ fname ,
+
+ const std::vector < std::valarray < double >> &
+ X
+
+ )
+
+
+
+
Save a given n-dimensional data martix to file.
+
Parameters
+
+ [in] fname filename to save in (gets overwriten without confirmation) [in] X matrix to save
+
+
+
Returns 0 if all ok
+
+-1 if file creation failed
+
+
59 size_t num_points = X.
size ();
+
60 size_t num_features = X[0].
size ();
+
+
+
+
+
+
66 std::cerr <<
"Error opening file " << fname <<
"\n" ;
+
+
+
+
+
71 for (
int i = 0; i < num_points; i++) {
+
+
73 for (
int j = 0; j < num_features; j++) {
+
+
75 if (j < num_features - 1)
+
+
+
78 if (i < num_points - 1)
+
+
+
+
+
+
+
+
+
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5
new file mode 100644
index 000000000..fc02999eb
--- /dev/null
+++ b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5
@@ -0,0 +1 @@
+ea4755d0b258a0c44dd370d5fd895774
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg
new file mode 100644
index 000000000..0cce4ec13
--- /dev/null
+++ b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+save_2d_data
+
+Node1
+
+save_2d_data
+
+
+
+
+Node2
+
+std::ofstream::close
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::ofstream::open
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map
new file mode 100644
index 000000000..16587af97
--- /dev/null
+++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5
new file mode 100644
index 000000000..65528be98
--- /dev/null
+++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5
@@ -0,0 +1 @@
+4d255c94880b923cc5d8cd1a22280ced
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg
new file mode 100644
index 000000000..c75aa905b
--- /dev/null
+++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+save_nd_data
+
+Node1
+
+save_nd_data
+
+
+
+
+Node2
+
+std::ofstream::close
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::ofstream::open
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map
new file mode 100644
index 000000000..a1915fc8e
--- /dev/null
+++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5
new file mode 100644
index 000000000..746824096
--- /dev/null
+++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5
@@ -0,0 +1 @@
+3b1f452272b5d9c72e6997d348464573
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg
new file mode 100644
index 000000000..85990cd27
--- /dev/null
+++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+get_min_2d
+
+Node1
+
+get_min_2d
+
+
+
+
+Node2
+
+std::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::distance
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::end
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::min_element
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html
new file mode 100644
index 000000000..48328f5c2
--- /dev/null
+++ b/d9/d69/median__search_8cpp.html
@@ -0,0 +1,274 @@
+
+
+
+Algorithms_in_C++: search/median_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Median search algorithm
+More...
+
#include <algorithm>#include <iostream>#include <vector>
+
+
Median search algorithm
+
Warning This core is erroneous and gives invorrect answers. Tested using cases from here
+
+
+
◆
+
+
+
+
+template<class X >
+
+
+
Todo: add documentation
+
+
+
20 std::cout << (*s2)[0] <<
" is the " << x + 1 <<
"th element from front" ;
+
21 }
else if (s1->
size () > x) {
+
+
23 std::cout << (*s1)[x] <<
" is the " << x + 1 <<
"th element from front" ;
+
24 }
else if (s1->
size () + s2->
size () <= x && s3->
size () > x) {
+
+
+
27 <<
"th element from front" ;
+
+
29 std::cout << x + 1 <<
" is invalid location" ;
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
55 int avg1, avg2, avg3, sum1 = 0, sum2 = 0, sum3 = 0;
+
+
57 for (
int i = 0; i < v.size(); i++) {
+
58 if (v.back() == v[median]) {
+
59 avg1 = sum1 + v.back();
+
+
61 }
else if (v.back() < v[median]) {
+
62 avg2 = sum2 + v.back();
+
+
+
65 avg3 = sum3 + v.back();
+
+
+
+
+
+
+
72 std::cout <<
"enter the no. to be searched form begining:- " ;
+
+
74 comp (x - 1, &s1, &s2, &s3);
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5
new file mode 100644
index 000000000..9fcab6e19
--- /dev/null
+++ b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5
@@ -0,0 +1 @@
+ffe873f0ea41b0d1591f9c6dca12a1bd
\ No newline at end of file
diff --git a/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg
new file mode 100644
index 000000000..6705fab15
--- /dev/null
+++ b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+comp
+
+Node1
+
+comp
+
+
+
+
+Node2
+
+std::vector::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::end
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::vector::size
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::sort
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..fce1bb2f7
--- /dev/null
+++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..73ced9d16
--- /dev/null
+++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+5e4324f1c9b40fc1eb0cea21e20aaf71
\ 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
new file mode 100644
index 000000000..9625fa772
--- /dev/null
+++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,142 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+comp
+
+
+
+
+Node1->Node2
+
+
+
+Node7
+
+std::endl
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::vector::push_back
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+std::rand
+
+
+
+
+Node1->Node9
+
+
+
+Node3
+
+std::vector::begin
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::vector::end
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+std::sort
+
+
+
+
+Node2->Node6
+
+
+
diff --git a/d9/d78/factorial_8cpp__incl.map b/d9/d78/factorial_8cpp__incl.map
new file mode 100644
index 000000000..ddb004d6d
--- /dev/null
+++ b/d9/d78/factorial_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d78/factorial_8cpp__incl.md5 b/d9/d78/factorial_8cpp__incl.md5
new file mode 100644
index 000000000..5158a37ae
--- /dev/null
+++ b/d9/d78/factorial_8cpp__incl.md5
@@ -0,0 +1 @@
+bfde82a4fcfc96f2b0afdb174fb9ba9c
\ No newline at end of file
diff --git a/d9/d78/factorial_8cpp__incl.svg b/d9/d78/factorial_8cpp__incl.svg
new file mode 100644
index 000000000..f2ac8a81b
--- /dev/null
+++ b/d9/d78/factorial_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+math/factorial.cpp
+
+Node1
+
+math/factorial.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d7d/primality__test_8cpp__incl.map b/d9/d7d/primality__test_8cpp__incl.map
new file mode 100644
index 000000000..5dc4ce98c
--- /dev/null
+++ b/d9/d7d/primality__test_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/d7d/primality__test_8cpp__incl.md5 b/d9/d7d/primality__test_8cpp__incl.md5
new file mode 100644
index 000000000..72571c941
--- /dev/null
+++ b/d9/d7d/primality__test_8cpp__incl.md5
@@ -0,0 +1 @@
+e1f3170057b0757766eb5fd481b90b26
\ No newline at end of file
diff --git a/d9/d7d/primality__test_8cpp__incl.svg b/d9/d7d/primality__test_8cpp__incl.svg
new file mode 100644
index 000000000..9343bf7f7
--- /dev/null
+++ b/d9/d7d/primality__test_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/primality_test.cpp
+
+Node1
+
+others/primality_test.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/d89/fibonacci_8cpp.html b/d9/d89/fibonacci_8cpp.html
new file mode 100644
index 000000000..00754b4a0
--- /dev/null
+++ b/d9/d89/fibonacci_8cpp.html
@@ -0,0 +1,168 @@
+
+
+
+Algorithms_in_C++: math/fibonacci.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Generate fibonacci sequence.
+More...
+
#include <cassert>#include <iostream>
+int fibonacci (unsigned int n) main () Main function.
+
+
Generate fibonacci sequence.
+
Calculate the the value on Fibonacci's sequence given an integer as input.
+\[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\]
+
+
See also fibonacci_large.cpp , fibonacci_fast.cpp , string_fibonacci.cpp
+
+
+
◆
+
+
+
+
+
+ int fibonacci
+ (
+ unsigned int
+ n )
+
+
+
+
Recursively compute sequences
+
+
+
+
+
int fibonacci(unsigned int n)
Definition: fibonacci.cpp:17
Algorithms_in_C++: Btree Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data Btree * left Btree * right
+
The documentation for this struct was generated from the following file:
+data_structures/morrisinorder.cpp
+
+
+
+
diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.md5 b/d9/dbf/brute__force__string__searching_8cpp__incl.md5
new file mode 100644
index 000000000..1ce544ba0
--- /dev/null
+++ b/d9/dbf/brute__force__string__searching_8cpp__incl.md5
@@ -0,0 +1 @@
+d6b23ef52c7bc9c6d2e62d9dd866eeb7
\ No newline at end of file
diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.svg b/d9/dbf/brute__force__string__searching_8cpp__incl.svg
new file mode 100644
index 000000000..a757ce054
--- /dev/null
+++ b/d9/dbf/brute__force__string__searching_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+strings/brute_force_string_searching.cpp
+
+Node1
+
+strings/brute_force
+_string_searching.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstring
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d9/dd7/interpolation__search_8cpp.html b/d9/dd7/interpolation__search_8cpp.html
new file mode 100644
index 000000000..278934a49
--- /dev/null
+++ b/d9/dd7/interpolation__search_8cpp.html
@@ -0,0 +1,250 @@
+
+
+
+Algorithms_in_C++: search/interpolation_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Interpolation search algorithm
+More...
+
#include <iostream>
+
+
+
+
◆
+
+
+
+
+
+ int interpolation_search
+ (
+ int
+ arr [],
+
+ int
+ value ,
+
+ int
+ len
+
+ )
+
+
+
+
function to search the value in an array using interpolation search
Parameters
+
+ [in] arr array to search in [in] value value to search for [in] len length of array
+
+
+
Returns index where the value is found
+
+0 if not found
+
+
16 int low = 0, high, mid;
+
+
+
19 while (arr[low] <= value && arr[high] >= value) {
+
+
21 ((value - arr[low]) * (high - low)) / (arr[high] - arr[low]));
+
+
+
24 else if (arr[mid] < value)
+
+
+
+
+
+
30 if (arr[low] == value)
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
40 std::cout <<
"Enter the size of array(less than 100) : " ;
+
+
+
43 int *array =
new int [n];
+
+
+
+
47 for (
int i = 0; i < n; i++) std::cin >> array[i];
+
+
49 std::cout <<
"Enter the value you want to search : " ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int interpolation_search(int arr[], int value, int len)
Definition: interpolation_search.cpp:15
+
diff --git a/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..65f27786a
--- /dev/null
+++ b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+d665af387919874679ac99ee240f5731
\ No newline at end of file
diff --git a/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..2b968beda
--- /dev/null
+++ b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+interpolation_search
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/d9/dd9/bisection__method_8cpp__incl.map b/d9/dd9/bisection__method_8cpp__incl.map
new file mode 100644
index 000000000..f3ad1c718
--- /dev/null
+++ b/d9/dd9/bisection__method_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d9/dd9/bisection__method_8cpp__incl.md5 b/d9/dd9/bisection__method_8cpp__incl.md5
new file mode 100644
index 000000000..494eae297
--- /dev/null
+++ b/d9/dd9/bisection__method_8cpp__incl.md5
@@ -0,0 +1 @@
+932365bfc0159aecb9dc21f24f13830d
\ No newline at end of file
diff --git a/d9/dd9/bisection__method_8cpp__incl.svg b/d9/dd9/bisection__method_8cpp__incl.svg
new file mode 100644
index 000000000..e4c97a1ec
--- /dev/null
+++ b/d9/dd9/bisection__method_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+numerical_methods/bisection_method.cpp
+
+Node1
+
+numerical_methods/bisection
+_method.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+limits
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.map b/d9/ddb/tower__of__hanoi_8cpp__incl.map
new file mode 100644
index 000000000..082c96e9a
--- /dev/null
+++ b/d9/ddb/tower__of__hanoi_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.md5 b/d9/ddb/tower__of__hanoi_8cpp__incl.md5
new file mode 100644
index 000000000..52b17e7d5
--- /dev/null
+++ b/d9/ddb/tower__of__hanoi_8cpp__incl.md5
@@ -0,0 +1 @@
+61c2e8ebf033582959aed4ad46852c71
\ No newline at end of file
diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.svg b/d9/ddb/tower__of__hanoi_8cpp__incl.svg
new file mode 100644
index 000000000..55516a272
--- /dev/null
+++ b/d9/ddb/tower__of__hanoi_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/tower_of_hanoi.cpp
+
+Node1
+
+others/tower_of_hanoi.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d9/dee/classdouble__linked__list.html b/d9/dee/classdouble__linked__list.html
new file mode 100644
index 000000000..4450c7e40
--- /dev/null
+++ b/d9/dee/classdouble__linked__list.html
@@ -0,0 +1,134 @@
+
+
+
+Algorithms_in_C++: double_linked_list Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+insert (int x) remove (int x) search (int x) show () reverseShow ()
+
The documentation for this class was generated from the following file:
+data_structures/doubly_linked_list.cpp
+
+
+
+
diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.md5 b/d9/dfd/primes__up__to__billion_8cpp__incl.md5
new file mode 100644
index 000000000..af03add45
--- /dev/null
+++ b/d9/dfd/primes__up__to__billion_8cpp__incl.md5
@@ -0,0 +1 @@
+30f446c73a35914d6eaa38cf09aa572d
\ No newline at end of file
diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.svg b/d9/dfd/primes__up__to__billion_8cpp__incl.svg
new file mode 100644
index 000000000..819c308a9
--- /dev/null
+++ b/d9/dfd/primes__up__to__billion_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/primes_up_to_billion.cpp
+
+Node1
+
+math/primes_up_to_billion.cpp
+
+
+
+
+Node2
+
+cstring
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/da/d23/eulers__totient__function_8cpp.html b/da/d23/eulers__totient__function_8cpp.html
new file mode 100644
index 000000000..7e95042f3
--- /dev/null
+++ b/da/d23/eulers__totient__function_8cpp.html
@@ -0,0 +1,187 @@
+
+
+
+Algorithms_in_C++: math/eulers_totient_function.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ Program to find Euler's Totient function.
+More...
+
#include <cstdlib>#include <iostream>
+uint64_t phiFunction (uint64_t n) main (int argc, char *argv[]) Main function.
+
+
C++ Program to find Euler's Totient function.
+
Euler Totient Function is also known as phi function.
+\[\phi(n) = \phi\left({p_1}^{a_1}\right)\cdot\phi\left({p_2}^{a_2}\right)\ldots\]
+
+
where \(p_1\), \(p_2\), \(\ldots\) are prime factors of n.
+\(\phi(n) = n-1\)
+\(\phi(n^k) = n^k - n^{k-1}\)
+\(\phi(a,b) = \phi(a)\cdot\phi(b)\) where a and b are relative primes.
+
+
Applying this 3 properties on the first equation.
+\[\phi(n) = n\cdot\left(1-\frac{1}{p_1}\right)\cdot\left(1-\frac{1}{p_2}\right)\cdots\]
+
+
where \(p_1\), \(p_2\)... are prime factors. Hence Implementation in \(O\left(\sqrt{n}\right)\).
+\(\phi(100) = 40\)
+\(\phi(1) = 1\)
+\(\phi(17501) = 15120\)
+\(\phi(1420) = 560\)
+
+
+
+
◆
+
+
+
+
+
+ uint64_t phiFunction
+ (
+ uint64_t
+ n )
+
+
+
+
Function to caculate Euler's totient phi
+
+
+
34 for (uint64_t i = 2; i * i <= n; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: math/sqrt_double.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.
+More...
+
#include <cassert>#include <iostream>
+
+
Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.
+
See also Can be implemented using faster and better algorithms like newton_raphson_method.cpp and false_position.cpp
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
◆
+
+
+
+
+
+ double Sqrt
+ (
+ double
+ a )
+
+
+
+
Bisection method implemented for the function \(x^2-a=0\) whose roots are \(\pm\sqrt{a}\) and only the positive root is returned.
+
+
+
18 return 1 /
Sqrt (1 /
a );
+
+
+
+
+
+
+
+
26 double epsilon = 1e-12;
+
+
28 double mid = (l + r) / 2;
+
+
+
+
32 if (
a - mid * mid < epsilon) {
+
+
+
+
+
+
+
+
+
+
+
+
double Sqrt(double a)
Definition: sqrt_double.cpp:16
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..6e5f3c8a3
--- /dev/null
+++ b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+0176794783568318387cfc3255334703
\ 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
new file mode 100644
index 000000000..d91c49954
--- /dev/null
+++ b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::fixed
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+Sqrt
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.map b/da/d35/sieve__of__eratosthenes_8cpp__incl.map
new file mode 100644
index 000000000..41109c6d6
--- /dev/null
+++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.md5 b/da/d35/sieve__of__eratosthenes_8cpp__incl.md5
new file mode 100644
index 000000000..0c712b49b
--- /dev/null
+++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.md5
@@ -0,0 +1 @@
+791cb4e5ff70b85cb6b28271313338ec
\ No newline at end of file
diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.svg b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg
new file mode 100644
index 000000000..e461ad1b5
--- /dev/null
+++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+math/sieve_of_eratosthenes.cpp
+
+Node1
+
+math/sieve_of_eratosthenes.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.map b/da/d5d/non__recursive__merge__sort_8cpp__incl.map
new file mode 100644
index 000000000..ff05e0d3b
--- /dev/null
+++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.md5 b/da/d5d/non__recursive__merge__sort_8cpp__incl.md5
new file mode 100644
index 000000000..769d5eea4
--- /dev/null
+++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.md5
@@ -0,0 +1 @@
+58df0c0445e990312cb71446036b3b36
\ No newline at end of file
diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg
new file mode 100644
index 000000000..35ad5e577
--- /dev/null
+++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+sorting/non_recursive_merge_sort.cpp
+
+Node1
+
+sorting/non_recursive
+_merge_sort.cpp
+
+
+
+
+Node2
+
+cstddef
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+utility
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/da/d7b/primality__test_8cpp.html b/da/d7b/primality__test_8cpp.html
new file mode 100644
index 000000000..6b6ca2976
--- /dev/null
+++ b/da/d7b/primality__test_8cpp.html
@@ -0,0 +1,213 @@
+
+
+
+Algorithms_in_C++: others/primality_test.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Primality test implementation.
+More...
+
#include <iostream>
+
+
Primality test implementation.
+
A simple and efficient implementation of a function to test if a number is prime, based on the fact that
+Every Prime number, except 2 and 3, are of the form \(6k\pm1\) for integer values of k.
+
+
This gives a 3x speed improvement.
+
+
+
◆
+
+
+
+
+
+ bool IsPrime
+ (
+ int
+ number )
+
+
+
+
Check if a number is prime
Parameters
+
+ [in] number number to check
+
+
+
Returns true if prime else false
+
+
19 if (((!(number & 1)) && number != 2) || (number < 2) ||
+
20 (number % 3 == 0 && number != 3))
+
+
+
23 for (
int k = 1; 36 *
k *
k - 12 *
k < number; ++
k ) {
+
24 if ((number % (6 *
k + 1) == 0) || (number % (6 *
k - 1) == 0))
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
33 std::cout <<
"Enter the value of n to check if Prime\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
ll k
Definition: matrix_exponentiation.cpp:48
bool IsPrime(int number)
Definition: primality_test.cpp:18
+
diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..961035459
--- /dev/null
+++ b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+a3db6c349ac8859688ff501e9f3bf486
\ 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
new file mode 100644
index 000000000..678df135c
--- /dev/null
+++ b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+IsPrime
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/da/d8a/paranthesis__matching_8cpp__incl.map b/da/d8a/paranthesis__matching_8cpp__incl.map
new file mode 100644
index 000000000..3881edb3b
--- /dev/null
+++ b/da/d8a/paranthesis__matching_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/da/d8a/paranthesis__matching_8cpp__incl.md5 b/da/d8a/paranthesis__matching_8cpp__incl.md5
new file mode 100644
index 000000000..324b52ee5
--- /dev/null
+++ b/da/d8a/paranthesis__matching_8cpp__incl.md5
@@ -0,0 +1 @@
+0d81f1e5f2406777e3ec79c8049531af
\ No newline at end of file
diff --git a/da/d8a/paranthesis__matching_8cpp__incl.svg b/da/d8a/paranthesis__matching_8cpp__incl.svg
new file mode 100644
index 000000000..54c539b44
--- /dev/null
+++ b/da/d8a/paranthesis__matching_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+others/paranthesis_matching.cpp
+
+Node1
+
+others/paranthesis
+_matching.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstring
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html
new file mode 100644
index 000000000..e0d56a504
--- /dev/null
+++ b/da/d9a/class_graph.html
@@ -0,0 +1,581 @@
+
+
+
+Algorithms_in_C++: Graph Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Graph (int V, int E) addEdge (int src, int dst, int weight) Graph (int V) addEdge (int src, int dst, int weight) Graph (Graph &&)=default Graph & operator= (Graph &&)=default Graph (Graph const &)=default Graph & operator= (Graph const &)=default Graph (unsigned int vertices, AdjList const &adjList) Graph (unsigned int vertices, AdjList &&adjList) Graph (unsigned int vertices, std::vector < Edge > const &edges) std::remove_reference_t< AdjList > const & getAdjList () const std::remove_reference_t< unsigned int > const & getVertices () const void addVertices (unsigned int num=1) void addEdge (Edge const &edge) void addEdge (unsigned int source, unsigned int destination) set_graph (void) ford_fulkerson (void) print_flow_info (void) Graph (const int V) addEdge (int src, int dst, int weight)
+vertexNum edgeNum Edge * edges edges
+bfs (int source, int sink)
+m_vertices AdjList m_adjList residual_capacity [MAXN][MAXN] capacity [MAXN][MAXN] total_nodes total_edges source sink parent [MAXN] std::vector < std::tuple < int, int, int > > edge_participated std::bitset < MAXN > visited max_flow = 0
+
+
Implementation of graph class.
+
The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).
+
+
+
◆ [1/3]
+
+
+
+
+
+
+
+
+ Graph::Graph
+ (
+ unsigned int
+ vertices ,
+
+ AdjList const & adjList
+
+ )
+
+
+
+
+inline
+
+
+
+
Create a graph from vertices and adjacency list.
+
Parameters
+
+ vertices specify the number of vertices the graph would contain. adjList is the adjacency list representation of graph.
+
+
+
71 : m_vertices(vertices), m_adjList(adjList) {}
+
+
+
+
+
◆ [2/3]
+
+
+
+
+
+
+
+
+ Graph::Graph
+ (
+ unsigned int
+ vertices ,
+
+ AdjList && adjList
+
+ )
+
+
+
+
+inline
+
+
+
+
Create a graph from vertices and adjacency list.
+
Parameters
+
+ vertices specify the number of vertices the graph would contain. adjList is the adjacency list representation of graph.
+
+
+
+
+
+
+
◆ [3/3]
+
+
+
+
+
+
+
+
+ Graph::Graph
+ (
+ unsigned int
+ vertices ,
+
+ std::vector < Edge > const & edges
+
+ )
+
+
+
+
+inline
+
+
+
+
Create a graph from vertices and a set of edges.
+
Adjacency list of the graph would be created from the set of edges. If the source or destination of any edge has a value greater or equal to number of vertices, then it would throw a range_error.
+
Parameters
+
+ vertices specify the number of vertices the graph would contain. edges is a vector of edges.
+
+
+
91 : m_vertices(vertices) {
+
92 for (
auto const & edge : edges) {
+
93 if (edge.src >= vertices || edge.dest >= vertices) {
+
+
95 "Either src or dest of edge out of range" );
+
+
97 m_adjList[edge.src].emplace_back(edge.dest);
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
+
+
+
+
+ void Graph::addEdge
+ (
+ Edge const & edge )
+
+
+
+
+inline
+
+
+
+
Add an edge in the graph.
+
Parameters
+
+ edge that needs to be added.
+
+
+
+
129 if (edge.src >= m_vertices || edge.dest >= m_vertices) {
+
+
+
132 m_adjList[edge.src].emplace_back(edge.dest);
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
+
+
+
+
+ void Graph::addEdge
+ (
+ unsigned int
+ source ,
+
+ unsigned int
+ destination
+
+ )
+
+
+
+
+inline
+
+
+
+
Add an Edge in the graph
+
Parameters
+
+ source is source vertex of the edge. destination is the destination vertex of the edge.
+
+
+
+
141 if (source >= m_vertices || destination >= m_vertices) {
+
+
143 "Either source or destination of edge out of range" );
+
+
145 m_adjList[source].emplace_back(destination);
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ void Graph::addVertices
+ (
+ unsigned int
+ num = 1)
+
+
+
+
+inline
+
+
+
+
Add vertices in the graph.
+
Parameters
+
+ num is the number of vertices to be added. It adds 1 vertex by default.
+
+
+
122 { m_vertices += num; }
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ std::remove_reference_t<AdjList > const& Graph::getAdjList
+ (
+ )
+ const
+
+
+
+
+inline
+
+
+
+
Return a const reference of the adjacency list.
+
Returns const reference to the adjacency list
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ std::remove_reference_t<unsigned int> const& Graph::getVertices
+ (
+ )
+ const
+
+
+
+
+inline
+
+
+
+
Returns number of vertices in the graph.
+
+
+
+
The documentation for this class was generated from the following files:
+dynamic_programming/bellman_ford.cpp
+dynamic_programming/floyd_warshall.cpp
+graph/cycle_check_directed_graph.cpp
+graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
+greedy_algorithms/dijkstra.cpp
+
+
+
Algorithms_in_C++: others/palindrome_of_number.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Check if a number is palindrome or not.
+More...
+
#include <algorithm>#include <iostream>#include <cstring>
+
+
Check if a number is palindrome or not.
+
This program cheats by using the STL library's std::reverse function.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..872193869
--- /dev/null
+++ b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+96910d526327bd4ff05b94521e561074
\ 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
new file mode 100644
index 000000000..0467d84a8
--- /dev/null
+++ b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::string::begin
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::string::end
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::reverse
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::to_string
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map
new file mode 100644
index 000000000..df0d4d328
--- /dev/null
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5
new file mode 100644
index 000000000..e276df400
--- /dev/null
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5
@@ -0,0 +1 @@
+b8bfec821ee10d3c3cbf2dac5a63bec0
\ 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
new file mode 100644
index 000000000..b7de37ee0
--- /dev/null
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+machine_learning::adaline
+
+Node1
+
+machine_learning::adaline
+
+
+
+
+Node2
+
+std::vector< double >
+
+
+
+
+Node2->Node1
+ weights
+
+
+
diff --git a/da/dd9/happy__number_8cpp__incl.map b/da/dd9/happy__number_8cpp__incl.map
new file mode 100644
index 000000000..76d6c53d6
--- /dev/null
+++ b/da/dd9/happy__number_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/da/dd9/happy__number_8cpp__incl.md5 b/da/dd9/happy__number_8cpp__incl.md5
new file mode 100644
index 000000000..f46a72ad7
--- /dev/null
+++ b/da/dd9/happy__number_8cpp__incl.md5
@@ -0,0 +1 @@
+b5de4be68414ece03921ca3e2ee5411b
\ No newline at end of file
diff --git a/da/dd9/happy__number_8cpp__incl.svg b/da/dd9/happy__number_8cpp__incl.svg
new file mode 100644
index 000000000..a3a3c11ab
--- /dev/null
+++ b/da/dd9/happy__number_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/happy_number.cpp
+
+Node1
+
+others/happy_number.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/da/de7/decimal__to__hexadecimal_8cpp.html b/da/de7/decimal__to__hexadecimal_8cpp.html
new file mode 100644
index 000000000..8bd94d480
--- /dev/null
+++ b/da/de7/decimal__to__hexadecimal_8cpp.html
@@ -0,0 +1,182 @@
+
+
+
+Algorithms_in_C++: others/decimal_to_hexadecimal.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Convert decimal number to hexadecimal representation.
+More...
+
#include <iostream>
+
+
Convert decimal number to hexadecimal representation.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
Main program
+
+
12 int valueToConvert = 0;
+
+
+
15 char HexValues[] =
"0123456789ABCDEF" ;
+
+
+
+
+
+
+
22 while (valueToConvert > 15) {
+
23 hexArray[i++] = valueToConvert % 16;
+
+
+
+
27 hexArray[i] = valueToConvert;
+
+
+
30 while (i >= 0)
std::cout << HexValues[hexArray[i--]];
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
new file mode 100644
index 000000000..86a68ba5f
--- /dev/null
+++ b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
@@ -0,0 +1 @@
+7b66b13cd9e906646a781de5e20f13d9
\ 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
new file mode 100644
index 000000000..01ecc6aea
--- /dev/null
+++ b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html
new file mode 100644
index 000000000..1eff890f2
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp.html
@@ -0,0 +1,586 @@
+
+
+
+Algorithms_in_C++: numerical_methods/durand_kerner_roots.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm
+More...
+
#include <algorithm>#include <cassert>#include <cmath>#include <complex>#include <cstdlib>#include <ctime>#include <fstream>#include <iostream>#include <valarray>
+#define ACCURACY 1e-10 MAX_BUFF_SIZE 50
+
+
Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm
+
Author Krishna Vedala
+
Test the algorithm online: https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7
+
Try the highly unstable Wilkinson's polynomial:
./numerical_methods/durand_kerner_roots 1 -210 20615 -1256850 53327946
+
-1672280820 40171771630 -756111184500 11310276995381 -135585182899530
+
1307535010540395 -10142299865511450 63030812099294896 -311333643161390640
+
1206647803780373360 -3599979517947607200 8037811822645051776
+
-12870931245150988800 13803759753640704000 -8752948036761600000
+
2432902008176640000
+
Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):
+
+
+
◆
+
+
+
+
+
+ #define ACCURACY 1e-10
+
+
+
+
maximum accuracy limit
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool check_termination
+ (
+ long double
+ delta )
+
+
+
+
check for termination condition
Parameters
+
+ [in] delta point at which to evaluate the polynomial
+
+
+
Returns false if termination not reached
+true if termination reached
+
+
92 static long double past_delta = INFINITY;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ const char* complex_str
+ (
+ const std::complex < double > &
+ x )
+
+
+
+
create a textual form of complex number
Parameters
+
+ [in] x point at which to evaluate the polynomial
+
+
+
Returns pointer to converted string
+
+
77 #define MAX_BUFF_SIZE 50
+
78 static char msg[MAX_BUFF_SIZE];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Implements Durand Kerner iterative algorithm to compute all roots of a polynomial.
+
Parameters
+
+ [in] coeffs coefficients of the polynomial [out] roots the computed roots of the polynomial [in] write_log flag whether to save the log file (default = false)
+
+
+
Returns pair of values - number of iterations taken and final accuracy achieved
+
+
112 long double tol_condition = 1;
+
+
+
+
+
+
+
+
+
121 log_file.
open (
"durand_kerner.log.csv" );
+
+
123 perror (
"Unable to create a storage log file!" );
+
+
+
126 log_file <<
"iter#," ;
+
+
128 for (n = 0; n < roots->size(); n++) log_file <<
"root_" << n <<
"," ;
+
+
130 log_file <<
"avg. correction" ;
+
+
132 for (n = 0; n < roots->size(); n++)
+
+
+
+
136 bool break_loop =
false ;
+
+
+
+
+
+
+
+
144 log_file <<
"\n" << iter <<
"," ;
+
+
+
147 #pragma omp parallel for shared(break_loop, tol_condition)
+
+
149 for (n = 0; n < roots->size(); n++) {
+
+
+
+
+
+
+
156 for (
int i = 0; i < roots->size(); i++)
+
+
158 denominator *= (*roots)[n] - (*roots)[i];
+
+
+
+
+
163 std::cerr <<
"\n\nOverflow/underrun error - got value = "
+
164 << std::abs(delta) <<
"\n" ;
+
+
+
+
+
169 (*roots)[n] -= delta;
+
+
+
+
+
174 tol_condition =
std::max (tol_condition, std::abs(std::abs(delta)));
+
+
+
+
+
+
+
+
182 for (n = 0; n < roots->size(); n++)
+
+
+
+
186 #if defined(DEBUG) || !defined(NDEBUG)
+
187 if (iter % 500 == 0) {
+
+
189 for (n = 0; n < roots->size(); n++)
+
+
191 std::cout <<
"\t\tabsolute average change: " << tol_condition
+
+
+
+
+
+
197 log_file << tol_condition;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Evaluate the value of a polynomial with given coefficients
Parameters
+
+ [in] coeffs coefficients of the polynomial [in] x point at which to evaluate the polynomial
+
+
+
Returns \(f(x)\)
+
+
55 double real = 0.f, imag = 0.f;
+
+
+
+
+
+
61 for (n = 0; n < coeffs.size(); n++) {
+
+
63 coeffs[n] *
std::pow (x, coeffs.size() - n - 1);
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test1
+ (
+ )
+
+
+
+
Self test the algorithm by checking the roots for \(x^2+4=0\) to which the roots are \(0 \pm 2i\)
+
+
+
+
+
+
+
+
+
+
216 for (
int n = 0; n < roots.size(); n++) {
+
+
+
+
+
+
+
+
224 for (
int i = 0; i < roots.size(); i++) {
+
+
+
+
228 for (
int j = 0; j < roots.size(); j++)
+
229 err1 |= std::abs(std::abs(roots[i] - expected[j])) < 1e-3;
+
+
+
+
233 std::cout <<
"Test 1 passed! - " << result.first <<
" iterations, "
+
234 << result.second <<
" accuracy"
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ )
+
+
+
+
Self test the algorithm by checking the roots for \(0.015625x^3-1=0\) to which the roots are \((4+0i),\,(-2\pm3.464i)\)
+
+
+
244 1. / 64., 0., 0., -1.};
+
+
+
+
+
+
+
+
252 for (
int n = 0; n < roots.size(); n++) {
+
+
+
+
+
+
+
+
260 for (
int i = 0; i < roots.size(); i++) {
+
+
+
+
264 for (
int j = 0; j < roots.size(); j++)
+
265 err1 |= std::abs(std::abs(roots[i] - expected[j])) < 1e-3;
+
+
+
+
269 std::cout <<
"Test 2 passed! - " << result.first <<
" iterations, "
+
270 << result.second <<
" accuracy"
+
+
+
+
+
+
+
+
+
bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
+
diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
new file mode 100644
index 000000000..586db3209
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -0,0 +1 @@
+d2f637fcf014076ba2cbd3f9b1b93fe4
\ 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
new file mode 100644
index 000000000..329315726
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -0,0 +1,232 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+durand_kerner_algo
+
+
+
+
+Node1->Node2
+
+
+
+Node15
+
+std::rand
+
+
+
+
+Node1->Node15
+
+
+
+Node3
+
+check_termination
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+complex_str
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::exit
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+std::ofstream::is_open
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::isinf
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+std::isnan
+
+
+
+
+Node2->Node8
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::ofstream::open
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+poly_function
+
+
+
+
+Node2->Node11
+
+
+
+Node12
+
+std::complex::imag
+
+
+
+
+Node11->Node12
+
+
+
+Node13
+
+std::pow
+
+
+
+
+Node11->Node13
+
+
+
+Node14
+
+std::complex::real
+
+
+
+
+Node11->Node14
+
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
new file mode 100644
index 000000000..0b0b0a3d8
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
@@ -0,0 +1,17 @@
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
new file mode 100644
index 000000000..9af71dddf
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
@@ -0,0 +1 @@
+a9cd90795b692401b9335f1a73a8038e
\ 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
new file mode 100644
index 000000000..f70b0b252
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@@ -0,0 +1,232 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+durand_kerner_algo
+
+
+
+
+Node1->Node2
+
+
+
+Node15
+
+std::rand
+
+
+
+
+Node1->Node15
+
+
+
+Node3
+
+check_termination
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+complex_str
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+std::exit
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+std::ofstream::is_open
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+std::isinf
+
+
+
+
+Node2->Node7
+
+
+
+Node8
+
+std::isnan
+
+
+
+
+Node2->Node8
+
+
+
+Node9
+
+std::max
+
+
+
+
+Node2->Node9
+
+
+
+Node10
+
+std::ofstream::open
+
+
+
+
+Node2->Node10
+
+
+
+Node11
+
+poly_function
+
+
+
+
+Node2->Node11
+
+
+
+Node12
+
+std::complex::imag
+
+
+
+
+Node11->Node12
+
+
+
+Node13
+
+std::pow
+
+
+
+
+Node11->Node13
+
+
+
+Node14
+
+std::complex::real
+
+
+
+
+Node11->Node14
+
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map
new file mode 100644
index 000000000..409c83458
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5
new file mode 100644
index 000000000..fe9377a58
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5
@@ -0,0 +1 @@
+2c145b5ecf01642704ae315c2884e089
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg
new file mode 100644
index 000000000..c535cfa3c
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+poly_function
+
+Node1
+
+poly_function
+
+
+
+
+Node2
+
+std::complex::imag
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::pow
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::complex::real
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map
new file mode 100644
index 000000000..1be4f943a
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map
@@ -0,0 +1,15 @@
+
+
diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5
new file mode 100644
index 000000000..0a3bb71f4
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5
@@ -0,0 +1 @@
+d975e88b18f81b99129d130f661e7bd8
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg
new file mode 100644
index 000000000..d4ad093f2
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg
@@ -0,0 +1,202 @@
+
+
+
+
+
+
+durand_kerner_algo
+
+Node1
+
+durand_kerner_algo
+
+
+
+
+Node2
+
+check_termination
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+complex_str
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::exit
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::isinf
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+std::isnan
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::max
+
+
+
+
+Node1->Node8
+
+
+
+Node9
+
+std::ofstream::open
+
+
+
+
+Node1->Node9
+
+
+
+Node10
+
+poly_function
+
+
+
+
+Node1->Node10
+
+
+
+Node11
+
+std::complex::imag
+
+
+
+
+Node10->Node11
+
+
+
+Node12
+
+std::pow
+
+
+
+
+Node10->Node12
+
+
+
+Node13
+
+std::complex::real
+
+
+
+
+Node10->Node13
+
+
+
diff --git a/da/dfd/buzz__number_8cpp__incl.map b/da/dfd/buzz__number_8cpp__incl.map
new file mode 100644
index 000000000..7c510932c
--- /dev/null
+++ b/da/dfd/buzz__number_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/da/dfd/buzz__number_8cpp__incl.md5 b/da/dfd/buzz__number_8cpp__incl.md5
new file mode 100644
index 000000000..507db8271
--- /dev/null
+++ b/da/dfd/buzz__number_8cpp__incl.md5
@@ -0,0 +1 @@
+1b31a059966c8ec67cb02a205e5e3b80
\ No newline at end of file
diff --git a/da/dfd/buzz__number_8cpp__incl.svg b/da/dfd/buzz__number_8cpp__incl.svg
new file mode 100644
index 000000000..76e2c8fb6
--- /dev/null
+++ b/da/dfd/buzz__number_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/buzz_number.cpp
+
+Node1
+
+others/buzz_number.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d07/spiral__print_8cpp.html b/db/d07/spiral__print_8cpp.html
new file mode 100644
index 000000000..352511642
--- /dev/null
+++ b/db/d07/spiral__print_8cpp.html
@@ -0,0 +1,308 @@
+
+
+
+Algorithms_in_C++: others/spiral_print.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Print the elements of a matrix traversing it spirally.
+More...
+
#include <iostream>
+
+
Print the elements of a matrix traversing it spirally.
+
+
+
◆
+
+
+
+
+
+ void genArray
+ (
+ int **
+ a ,
+
+ int
+ r ,
+
+ int
+ c
+
+ )
+
+
+
+
Arrange sequence of numbers from '1' in a matrix form
Parameters
+
+ [out] a matrix to fill [in] r number of rows [in] c number of columns
+
+
+
+
+
14 for (
int i = 0; i < r; i++) {
+
15 for (
int j = 0; j < c; j++) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
72 int **
a =
new int *[r];
+
73 for (
int i = 0; i < r; i++)
a [i] =
new int [c];
+
+
+
+
+
78 for (
int i = 0; i < r; i++)
delete []
a [i];
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void spiralPrint
+ (
+ int **
+ a ,
+
+ int
+ r ,
+
+ int
+ c
+
+ )
+
+
+
+
Traverse the matrix spirally and print the sequence of elements
Parameters
+
+ [in] a matrix to read from [in] r number of rows [in] c number of columns
+
+
+
Print start row
+
Print the end col
+
Print the end row
+
Print the start Col
+
+
30 int startRow = 0, endRow = r - 1;
+
31 int startCol = 0, endCol = c - 1;
+
+
+
34 while (startRow <= endRow && startCol <= endCol) {
+
+
36 for (
int i = startCol; i <= endCol; i++, cnt++) {
+
+
+
+
+
+
42 for (
int i = startRow; i <= endRow; i++, cnt++) {
+
+
+
+
+
+
+
+
+
+
52 for (
int i = endCol; i >= startCol; i--, cnt++) {
+
+
+
+
+
+
+
+
+
61 for (
int i = endRow; i >= startRow; i--, cnt++) {
+
+
+
+
+
+
+
+
+
+
void spiralPrint(int **a, int r, int c)
Definition: spiral_print.cpp:29
vector< ll > a
Definition: matrix_exponentiation.cpp:53
void genArray(int **a, int r, int c)
Definition: spiral_print.cpp:12
Algorithms_in_C++: math/prime_factorization.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Prime factorization of positive integers.
+More...
+
#include <algorithm>#include <cstring>#include <iostream>#include <vector>
+
+
Prime factorization of positive integers.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main program
+
+
+
64 std::cout <<
"\t\tComputes the prime factorization\n\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void prime_factorization
+ (
+ int
+ num )
+
+
+
+
Prime factorization of a number
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void SieveOfEratosthenes
+ (
+ int
+ N )
+
+
+
+
Calculating prime number upto a given range
+
+
+
+
+
27 for (
int i = 2; i <= N; i++) {
+
+
29 for (
int j = 2 * i; j <= N; j += i)
isprime [j] =
false ;
+
+
+
+
33 for (
int i = 2; i <= N; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
list of prime factor-pairs
+
+
+
+
+
◆
+
+
+
+
+
+ bool isprime[1000006]
+
+
+
+
Declaring variables for maintaing prime numbers and to check whether a number is prime or not
+
+
+
+
+
◆
+
+
+
+
list of prime numbers
+
+
+
+
+
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
bool isprime[1000006]
Definition: prime_factorization.cpp:13
+
diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5
new file mode 100644
index 000000000..55bedd74c
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5
@@ -0,0 +1 @@
+6cf5a359b2c2d158492f9577dcc7fa99
\ 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
new file mode 100644
index 000000000..4a88f6719
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+prime_factorization
+
+Node1
+
+prime_factorization
+
+
+
+
+Node2
+
+std::make_pair
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..15cc1f323
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..7dfb7dfd7
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+4fd38d0c941c97bda907e33b4a6d998e
\ 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
new file mode 100644
index 000000000..991480cd1
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+prime_factorization
+
+
+
+
+Node1->Node3
+
+
+
+Node5
+
+SieveOfEratosthenes
+
+
+
+
+Node1->Node5
+
+
+
+Node4
+
+std::make_pair
+
+
+
+
+Node3->Node4
+
+
+
+Node6
+
+std::vector::push_back
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map
new file mode 100644
index 000000000..91e8862d1
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5
new file mode 100644
index 000000000..df6615ef4
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5
@@ -0,0 +1 @@
+f13f9d23bc7efc9cac7d696b1768b0fd
\ 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
new file mode 100644
index 000000000..e651358d8
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+SieveOfEratosthenes
+
+Node1
+
+SieveOfEratosthenes
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d30/fast__power_8cpp__incl.map b/db/d30/fast__power_8cpp__incl.map
new file mode 100644
index 000000000..cbd97275a
--- /dev/null
+++ b/db/d30/fast__power_8cpp__incl.map
@@ -0,0 +1,9 @@
+
+
diff --git a/db/d30/fast__power_8cpp__incl.md5 b/db/d30/fast__power_8cpp__incl.md5
new file mode 100644
index 000000000..3ead40c3b
--- /dev/null
+++ b/db/d30/fast__power_8cpp__incl.md5
@@ -0,0 +1 @@
+f91403863302af788666224f2165fcb3
\ No newline at end of file
diff --git a/db/d30/fast__power_8cpp__incl.svg b/db/d30/fast__power_8cpp__incl.svg
new file mode 100644
index 000000000..8b68287b2
--- /dev/null
+++ b/db/d30/fast__power_8cpp__incl.svg
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+math/fast_power.cpp
+
+Node1
+
+math/fast_power.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstdint
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstdlib
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+ctime
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+iostream
+
+
+
+
+Node1->Node7
+
+
+
diff --git a/db/d3c/tower__of__hanoi_8cpp.html b/db/d3c/tower__of__hanoi_8cpp.html
new file mode 100644
index 000000000..f92fe537f
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp.html
@@ -0,0 +1,350 @@
+
+
+
+Algorithms_in_C++: others/tower_of_hanoi.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve the Tower of Hanoi problem.
+More...
+
#include <iostream>
+
+
Solve the Tower of Hanoi problem.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
74 std::cout <<
"\nEnter number of discs : " ;
+
+
+
77 for (
int i = no; i > 0; i--) {
+
78 F.values[F.top++] = i;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void mov
+ (
+ tower * From ,
+
+ tower * To
+
+ )
+
+
+
+
Move one disc from one tower to another
Parameters
+
+ [in,out] From tower to move disk from [in,out] To tower to move disk to
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void show
+ (
+ const struct tower *const
+ F ,
+
+ const struct tower *const
+ T ,
+
+ const struct tower *const
+ U
+
+ )
+
+
+
+
Display the towers
+
+
+
22 for (
int i = 0; i < F->
top ; i++) {
+
+
+
+
26 for (
int i = 0; i < U->
top ; i++) {
+
+
+
+
30 for (
int i = 0; i < T->
top ; i++) {
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void TH
+ (
+ int
+ n ,
+
+ tower * From ,
+
+ tower * Using ,
+
+ tower * To
+
+ )
+
+
+
+
Recursive algorithm to solve the puzzle
Parameters
+
+ [in] n starting number of disks [in,out] From tower to move disks from [in,out] Using temporary tower for the puzzle [in,out] To tower to move disk to
+
+
+
+
+
+
55 show (From, To, Using);
+
+
57 TH (n - 1, From, To, Using);
+
+
59 show (From, To, Using);
+
60 TH (n - 1, Using, From, To);
+
+
+
+
+
+
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
Definition: tower_of_hanoi.cpp:11
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int values[10]
Values in the tower.
Definition: tower_of_hanoi.cpp:13
int top
top tower ID
Definition: tower_of_hanoi.cpp:15
void TH(int n, tower *From, tower *Using, tower *To)
Definition: tower_of_hanoi.cpp:52
+
diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5
new file mode 100644
index 000000000..90b746fa7
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5
@@ -0,0 +1 @@
+e0e1459bfbaf15727ebfd078c2189da4
\ 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
new file mode 100644
index 000000000..f0c14110b
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+TH
+
+Node1
+
+TH
+
+
+
+
+Node2
+
+mov
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+show
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..86ef21d52
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..17d8d7685
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+a81da7ae9e4f154b7c29e84c6273dfe6
\ 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
new file mode 100644
index 000000000..0b4204a37
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,73 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+show
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+TH
+
+
+
+
+Node1->Node3
+
+
+
+Node3->Node2
+
+
+
+Node4
+
+mov
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/db/d51/fibonacci__fast_8cpp__incl.map b/db/d51/fibonacci__fast_8cpp__incl.map
new file mode 100644
index 000000000..92df6f22b
--- /dev/null
+++ b/db/d51/fibonacci__fast_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/db/d51/fibonacci__fast_8cpp__incl.md5 b/db/d51/fibonacci__fast_8cpp__incl.md5
new file mode 100644
index 000000000..4cae10256
--- /dev/null
+++ b/db/d51/fibonacci__fast_8cpp__incl.md5
@@ -0,0 +1 @@
+6ebc1eb36d5bf41d67032d323f0171b2
\ No newline at end of file
diff --git a/db/d51/fibonacci__fast_8cpp__incl.svg b/db/d51/fibonacci__fast_8cpp__incl.svg
new file mode 100644
index 000000000..1d6e10a15
--- /dev/null
+++ b/db/d51/fibonacci__fast_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+math/fibonacci_fast.cpp
+
+Node1
+
+math/fibonacci_fast.cpp
+
+
+
+
+Node2
+
+cinttypes
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdio
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/db/d66/struct_item.html b/db/d66/struct_item.html
new file mode 100644
index 000000000..09ffc0136
--- /dev/null
+++ b/db/d66/struct_item.html
@@ -0,0 +1,125 @@
+
+
+
+Algorithms_in_C++: Item Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+weight profit
+
The documentation for this struct was generated from the following file:
+greedy_algorithms/knapsack.cpp
+
+
+
Algorithms_in_C++: large_number Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
#include <large_number.h >
+
+
+
+static bool test ()
+template<class T > void multiply (const T n)
+
+
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.
+
+
+
◆ [1/4]
+
+
+
+
+
+
+
+
+ large_number::large_number
+ (
+ )
+
+
+
+
+inline
+
+
+
+
< initializer with value = 1
+
+
+
+
+
+
+
◆ [2/4]
+
+
+
+
+
+
+
+
+ large_number::large_number
+ (
+ int
+ n )
+
+
+
+
+inline explicit
+
+
+
+
< initializer from an integer initializer from another large_number
+
+
+
+
+
+
+
◆ [3/4]
+
+
+
+
+
+
+
+
+ large_number::large_number
+ (
+ const large_number &
+ a )
+
+
+
+
+inline
+
+
+
+
initializer from a vector
+
+
+
+
+
◆ [4/4]
+
+
+
+
+
+
+
+
+ large_number::large_number
+ (
+ std::vector < unsigned char > & vec )
+
+
+
+
+inline explicit
+
+
+
+
initializer from a string
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ void large_number::add_digit
+ (
+ unsigned int
+ value )
+
+
+
+
+inline
+
+
+
+
add a digit at MSB to the large number
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ const char large_number::digit_char
+ (
+ size_t
+ i )
+ const
+
+
+
+
+inline
+
+
+
+
returns i^th digit as an ASCII character
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class T >
+
+
+
+
+
+ void large_number::multiply
+ (
+ const T
+ n )
+
+
+
+
+inline private
+
+
+
+
multiply large number with another integer and store the result in the same large number
+
+
+
260 "Can only have integer types." );
+
+
+
+
+
265 uint64_t carry = 0, temp;
+
+
267 temp = (*this)[i] * n;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ const size_t large_number::num_digits
+ (
+ )
+ const
+
+
+
+
+inline
+
+
+
+
Get number of digits in the number
+
+
+
+
+
+
+
◆
+
+
+
+
+template<class T >
+
+
+
+
+
+ large_number & large_number::operator*= (
+ const T
+ n )
+
+
+
+
+inline
+
+
+
+
operator overload to increment
+
+
+
240 "Must be integer addition unsigned integer types." );
+
+
+
+
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
operator overload to increment (prefix)
+
+
+
+
+
◆ [2/2]
+
+
+
+
+
+
+
+
+ large_number & large_number::operator++ (
+ int
+ )
+
+
+
+
+inline
+
+
+
+
operator overload to increment (postfix)
+
+
+
+
+
◆
+
+
+
+
operator overload to add
+
+
+
+
+
196 unsigned int carry = 0;
+
+
198 for (i = 0; i < max_L || carry != 0; i++) {
+
+
+
+
+
+
204 (*this)[i] = carry % 10;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ unsigned char& large_number::operator[]
+ (
+ size_t
+ n )
+
+
+
+
+inline
+
+
+
+
operator over load to access the i^th digit conveniently and also assign value to it
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static bool large_number::test
+ (
+ )
+
+
+
+
+inline static
+
+
+
+
Function to check implementation
+
+
66 std::cout <<
"------ Checking `large_number` class implementations\t"
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
108 <<
"!=7000000000000000000000000005202)" <<
std::endl ;
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
operator overload to compare two numbers
+
+
+
+
+
◆
+
+
+
+
+template<class T >
+
+
+
operator overload to perform addition
+
+
+
+
+
◆
+
+
+
+
operator overload to compare two numbers
+
+
147 for (
size_t i =
a .num_digits(); i > 0; i--)
+
148 out << static_cast<int>(
a [i - 1]);
+
+
+
+
+
+
+
◆
+
+
+
+
operator overload to compare two numbers
+
+
156 size_t N =
a .num_digits();
+
157 if (N != b.num_digits())
+
+
159 for (
size_t i = 0; i < N; i++)
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ std::vector <unsigned char> large_number::_digits
+
+
+
+private
+
+
+
+
where individual digits are stored
+
+
+
+
The documentation for this class was generated from the following file:
+
+
void add_digit(unsigned int value)
Definition: large_number.h:118
Definition: large_number.h:24
const size_t num_digits() const
Definition: large_number.h:130
large_number()
Definition: large_number.h:27
void multiply(const T n)
Definition: large_number.h:258
std::vector< unsigned char > _digits
Definition: large_number.h:285
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5
new file mode 100644
index 000000000..351ec616a
--- /dev/null
+++ b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5
@@ -0,0 +1 @@
+8fd23292e49894c379ca9e9f8b776f74
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
new file mode 100644
index 000000000..988823a40
--- /dev/null
+++ b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
+
+large_number::large_number
+
+Node1
+
+large_number::large
+_number
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map
new file mode 100644
index 000000000..00a844106
--- /dev/null
+++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5
new file mode 100644
index 000000000..ade0b2809
--- /dev/null
+++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5
@@ -0,0 +1 @@
+0a5152f4f85e7068ba747643e10e2cc3
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg
new file mode 100644
index 000000000..6abd9dd62
--- /dev/null
+++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+large_number::num_digits
+
+Node1
+
+large_number::num_digits
+
+
+
+
+Node2
+
+std::vector::size
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map
new file mode 100644
index 000000000..448c30af7
--- /dev/null
+++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5
new file mode 100644
index 000000000..44b22fc70
--- /dev/null
+++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5
@@ -0,0 +1 @@
+104319d7ad94a3a0f6ae6a24828b39b4
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
new file mode 100644
index 000000000..f665ea4ce
--- /dev/null
+++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+large_number::multiply
+
+Node1
+
+large_number::multiply
+
+
+
+
+Node2
+
+large_number::add_digit
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+large_number::num_digits
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+std::vector::push_back
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+std::vector::size
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map
new file mode 100644
index 000000000..16af4d601
--- /dev/null
+++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5
new file mode 100644
index 000000000..cd8cf6e29
--- /dev/null
+++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5
@@ -0,0 +1 @@
+2193d4191a23c4df1c79d1f6b5bcc1e8
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
new file mode 100644
index 000000000..a99995bcf
--- /dev/null
+++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+large_number::add_digit
+
+Node1
+
+large_number::add_digit
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map
new file mode 100644
index 000000000..1f0e903f7
--- /dev/null
+++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5
new file mode 100644
index 000000000..193ad9778
--- /dev/null
+++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5
@@ -0,0 +1 @@
+d2bf160e494c8b78eb2f7a064f247e16
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
new file mode 100644
index 000000000..cf4a8bfbf
--- /dev/null
+++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+large_number::test
+
+Node1
+
+large_number::test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+large_number::large
+_number
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::vector::push_back
+
+
+
+
+Node3->Node4
+
+
+
diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map
new file mode 100644
index 000000000..533353aff
--- /dev/null
+++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5
new file mode 100644
index 000000000..2f242fc9b
--- /dev/null
+++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5
@@ -0,0 +1 @@
+092df34284fec296a5183c9966f15331
\ No newline at end of file
diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg
new file mode 100644
index 000000000..fe7687642
--- /dev/null
+++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg
@@ -0,0 +1,185 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+large_number::operator*=
+
+Node1
+
+large_number::operator*=
+
+
+
+
+Node2
+
+large_number::multiply
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+large_number::add_digit
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+large_number::num_digits
+
+
+
+
+Node2->Node5
+
+
+
+Node4
+
+std::vector::push_back
+
+
+
+
+Node3->Node4
+
+
+
+Node6
+
+std::vector::size
+
+
+
+
+Node5->Node6
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg
new file mode 100644
index 000000000..57e22ad05
--- /dev/null
+++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+large_number::operator*=
+
+Node1
+
+large_number::operator*=
+
+
+
+
+Node2
+
+large_number::multiply
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+large_number::add_digit
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+large_number::num_digits
+
+
+
+
+Node2->Node5
+
+
+
+Node4
+
+std::vector::push_back
+
+
+
+
+Node3->Node4
+
+
+
+Node6
+
+std::vector::size
+
+
+
+
+Node5->Node6
+
+
+
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map
new file mode 100644
index 000000000..d19f3a9e7
--- /dev/null
+++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5
new file mode 100644
index 000000000..0a31ca39f
--- /dev/null
+++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5
@@ -0,0 +1 @@
+15791d7b0638a2cc0a39bc3d720a228c
\ No newline at end of file
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
new file mode 100644
index 000000000..a8aebe2fe
--- /dev/null
+++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+large_number::large_number
+
+Node1
+
+large_number::large
+_number
+
+
+
+
+Node2
+
+large_number::add_digit
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::push_back
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map
new file mode 100644
index 000000000..07c8ea273
--- /dev/null
+++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5
new file mode 100644
index 000000000..b62089077
--- /dev/null
+++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5
@@ -0,0 +1 @@
+62ef5863160c17bf7805b896a62923e2
\ No newline at end of file
diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg
new file mode 100644
index 000000000..65bd31e69
--- /dev/null
+++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+large_number::digit_char
+
+Node1
+
+large_number::digit_char
+
+
+
+
+Node2
+
+large_number::num_digits
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/db/d8b/struct_node.html b/db/d8b/struct_node.html
new file mode 100644
index 000000000..351f865fe
--- /dev/null
+++ b/db/d8b/struct_node.html
@@ -0,0 +1,149 @@
+
+
+
+Algorithms_in_C++: Node Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Node (int v, Node *n)
+data next Node * next val Node * next
+
The documentation for this class was generated from the following files:
+
+
+
diff --git a/db/d8f/struct_btree__coll__graph.md5 b/db/d8f/struct_btree__coll__graph.md5
new file mode 100644
index 000000000..2a4a3a3f9
--- /dev/null
+++ b/db/d8f/struct_btree__coll__graph.md5
@@ -0,0 +1 @@
+da72bf5e647f072e1dd1d3dc40f0ce29
\ No newline at end of file
diff --git a/db/d8f/struct_btree__coll__graph.svg b/db/d8f/struct_btree__coll__graph.svg
new file mode 100644
index 000000000..fe0994265
--- /dev/null
+++ b/db/d8f/struct_btree__coll__graph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+Btree
+
+Node1
+
+Btree
+
+
+
+
+Node1->Node1
+ right
+left
+
+
+
diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html
new file mode 100644
index 000000000..e99f515db
--- /dev/null
+++ b/db/d93/check__prime_8cpp.html
@@ -0,0 +1,227 @@
+
+
+
+Algorithms_in_C++: math/check_prime.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.
+More...
+
#include <cassert>#include <iostream>
+template<typename T > bool is_prime (T num) int main ()
+
+
Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.
+
Copyright 2020
Author omkarlanghe
+
A simple program to check if the given number if prime or not.
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ bool is_prime
+ (
+ T
+ num )
+
+
+
+
Function to check if the given number is prime or not.
Parameters
+
+ num number to be checked.
+
+
+
Returns if number is prime, it returns @ true, else it returns @ false.
+
+
+
+
+
26 }
else if (num == 2) {
+
+
28 }
else if ((num & 1) == 0) {
+
+
+
+
32 for (T i = 3; (i * i) < (num); i = (i + 2)) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
bool is_prime(T num)
Definition: check_prime.cpp:22
+
diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..3cd5271c9
--- /dev/null
+++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+f74f1e830fea0a7ae8a99fce9ea6a54f
\ 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
new file mode 100644
index 000000000..3e6e5bad9
--- /dev/null
+++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+is_prime
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html
new file mode 100644
index 000000000..12b8fd4e1
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp.html
@@ -0,0 +1,414 @@
+
+
+
+Algorithms_in_C++: numerical_methods/ode_forward_euler.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
+More...
+
#include <cmath>#include <ctime>#include <fstream>#include <iostream>#include <valarray>
+void problem (const double &x, std::valarray < double > *y, std::valarray < double > *dy) Problem statement for a system with first-order differential equations. Updates the system differential variables. More... void exact_solution (const double &x, std::valarray < double > *y) Exact solution of the problem. Used for solution comparison. More... void forward_euler_step (const double dx, const double &x, std::valarray < double > *y, std::valarray < double > *dy) Compute next step approximation using the forward-Euler method. More... double forward_euler (double dx, double x0, double x_max, std::valarray < double > *y, bool save_to_file=false) Compute approximation using the forward-Euler method in the given limits. More... void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray < double > &Y0) int main (int argc, char *argv[])
+
+
Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
+
Authors Krishna Vedala
+
The ODE being solved is:
+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*}
+
+
The exact solution for the above problem is:
+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*}
+
+
The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison.
+
To implement Van der Pol oscillator , change the problem function to:
const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also ode_midpoint_euler.cpp , ode_semi_implicit_euler.cpp
+
+
+
◆
+
+
+
+
+
+ void exact_solution
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y
+
+ )
+
+
+
+
+
Exact solution of the problem. Used for solution comparison.
+
Parameters
+
+ [in] x independent variable [in,out] y dependent variable
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char *
+ argv []
+
+ )
+
+
+
+
Main Function
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
203 double total_time =
forward_euler (step_size, X0, X_MAX, &Y0,
true );
+
204 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void problem
+ (
+ const double &
+ x ,
+
+ std::valarray < double > * y ,
+
+ std::valarray < double > * dy
+
+ )
+
+
+
+
+
Problem statement for a system with first-order differential equations. Updates the system differential variables.
+
Note This function can be updated to and ode of any order.
+
Parameters
+
+ [in] x independent variable(s) [in,out] y dependent variable(s) [in,out] dy first-derivative of dependent variable(s)
+
+
+
+
56 const double omega = 1.F;
+
+
58 dy[0][1] = -omega * omega * y[0][0];
+
+
+
+
+
+
◆
+
+
+
+
+
+ void save_exact_solution
+ (
+ const double &
+ X0 ,
+
+ const double &
+ X_MAX ,
+
+ const double &
+ step_size ,
+
+ const std::valarray < double > &
+ Y0
+
+ )
+
+
+
+
Function to compute and save exact solution for comparison
+
Parameters
+
+ [in] X0 initial value of independent variable [in] X_MAX final value of independent variable [in] step_size independent variable step size [in] Y0 initial values of dependent variables
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
168 for (
int i = 0; i < y.size() - 1; i++) {
+
+
+
171 fp << y[y.size() - 1] <<
"\n" ;
+
+
+
+
+
176 }
while (x <= X_MAX);
+
+
+
179 double total_time =
static_cast< double > (t2 - t1) / CLOCKS_PER_SEC;
+
180 std::cout <<
"\tTime = " << total_time <<
" ms\n" ;
+
+
+
+
+
+
+
+
+
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_forward_euler.cpp:67
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_forward_euler.cpp:152
double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the forward-Euler method in the given limits.
Definition: ode_forward_euler.cpp:102
+
diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
new file mode 100644
index 000000000..f32b05ae4
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -0,0 +1 @@
+1c011524884e08ee09e2a375bad79290
\ 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
new file mode 100644
index 000000000..b25912759
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -0,0 +1,241 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::atof
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+forward_euler
+
+
+
+
+Node1->Node3
+
+
+
+Node11
+
+save_exact_solution
+
+
+
+
+Node1->Node11
+
+
+
+Node4
+
+std::clock
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::ofstream::close
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+forward_euler_step
+
+
+
+
+Node3->Node6
+
+
+
+Node8
+
+std::ofstream::is_open
+
+
+
+
+Node3->Node8
+
+
+
+Node9
+
+std::ofstream::open
+
+
+
+
+Node3->Node9
+
+
+
+Node10
+
+std::perror
+
+
+
+
+Node3->Node10
+
+
+
+Node7
+
+problem
+
+
+
+
+Node6->Node7
+
+
+
+Node11->Node4
+
+
+
+Node11->Node5
+
+
+
+Node11->Node8
+
+
+
+Node11->Node10
+
+
+
+Node12
+
+exact_solution
+
+
+
+
+Node11->Node12
+
+
+
+Node13
+
+std::cos
+
+
+
+
+Node12->Node13
+
+
+
+Node14
+
+std::sin
+
+
+
+
+Node12->Node14
+
+
+
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
new file mode 100644
index 000000000..682408495
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
new file mode 100644
index 000000000..0658178d0
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
@@ -0,0 +1 @@
+e73ec3022db67a36c8cbe08bd9e8f092
\ 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
new file mode 100644
index 000000000..42b60ba06
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+save_exact_solution
+
+Node1
+
+save_exact_solution
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::ofstream::close
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+exact_solution
+
+
+
+
+Node1->Node4
+
+
+
+Node7
+
+std::ofstream::is_open
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+std::perror
+
+
+
+
+Node1->Node8
+
+
+
+Node5
+
+std::cos
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::sin
+
+
+
+
+Node4->Node6
+
+
+
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
new file mode 100644
index 000000000..fbb37ebae
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
new file mode 100644
index 000000000..53dab073e
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
@@ -0,0 +1 @@
+28f68d690a34e83ed529b0e7cf875a9c
\ 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
new file mode 100644
index 000000000..6b0aebf2e
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+exact_solution
+
+Node1
+
+exact_solution
+
+
+
+
+Node2
+
+std::cos
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::sin
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/db/dd4/structlist__coll__graph.map b/db/dd4/structlist__coll__graph.map
new file mode 100644
index 000000000..02369b136
--- /dev/null
+++ b/db/dd4/structlist__coll__graph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/db/dd4/structlist__coll__graph.md5 b/db/dd4/structlist__coll__graph.md5
new file mode 100644
index 000000000..ebc888f18
--- /dev/null
+++ b/db/dd4/structlist__coll__graph.md5
@@ -0,0 +1 @@
+b27f82817fdb09c9c12cc0ea928971fc
\ No newline at end of file
diff --git a/db/dd4/structlist__coll__graph.svg b/db/dd4/structlist__coll__graph.svg
new file mode 100644
index 000000000..2caf349ff
--- /dev/null
+++ b/db/dd4/structlist__coll__graph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+list
+
+Node1
+
+list
+
+
+
+
+Node1->Node1
+ next
+
+
+
diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html
new file mode 100644
index 000000000..be09d47a3
--- /dev/null
+++ b/db/df3/happy__number_8cpp.html
@@ -0,0 +1,206 @@
+
+
+
+Algorithms_in_C++: others/happy_number.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
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.
+More...
+
#include <iostream>
+template<typename T > bool is_happy (T n) int main ()
+
+
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.
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ bool is_happy
+ (
+ T
+ n )
+
+
+
+
Checks if a decimal number is a happy number
Returns true if happy else false
+
+
+
+
+
+
+
+
+
+
+
+
25 return (n == 1) ? true :
false ;
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
+
bool is_happy(T n)
Definition: happy_number.cpp:14
+
diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..902727a46
--- /dev/null
+++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+f21e4c6581963c7779fe9d4f680ff130
\ 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
new file mode 100644
index 000000000..d45112587
--- /dev/null
+++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+is_happy
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html
new file mode 100644
index 000000000..1c9bd6b8b
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp.html
@@ -0,0 +1,291 @@
+
+
+
+Algorithms_in_C++: others/pascal_triangle.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Pascal's triangle implementation.
+More...
+
#include <cstring>#include <iomanip>#include <iostream>
+
+
Pascal's triangle implementation.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
+
+
+
+
59 int **arr =
new int *[n];
+
60 for (
int i = 0; i < n; ++i) {
+
61 arr[i] =
new int [2 * n - 1];
+
62 memset (arr[i], 0,
sizeof (
int ) * (2 * n - 1));
+
+
+
+
+
+
+
69 for (
int i = 0; i < n; ++i) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int** pascal_triangle
+ (
+ int **
+ arr ,
+
+ int
+ n
+
+ )
+
+
+
+
Print the triangle
Parameters
+
+ [in,out] arr array containing Pascal numbers [in] n depth of Pascal triangle to print
+
+
+
Returns arr pointer returned
+
+
37 for (
int i = 0; i < n; ++i) {
+
38 for (
int j = n - i - 1; j < n + i; ++j) {
+
39 if (j == n - i - 1 || j == n + i - 1)
+
+
+
42 arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void show_pascal
+ (
+ int **
+ arr ,
+
+ int
+ n
+
+ )
+
+
+
+
Print the triangle
Parameters
+
+ [in] arr 2D-array containing Pascal numbers [in] n depth of Pascal triangle to print
+
+
+
+
19 for (
int i = 0; i < n; ++i) {
+
20 for (
int j = 0; j < n + i; ++j) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int ** pascal_triangle(int **arr, int n)
Definition: pascal_triangle.cpp:36
void show_pascal(int **arr, int n)
Definition: pascal_triangle.cpp:18
+
diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5
new file mode 100644
index 000000000..26de61150
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5
@@ -0,0 +1 @@
+caa1a77c7731a9de31a29f525b2b4583
\ 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
new file mode 100644
index 000000000..4ad4ceaac
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+show_pascal
+
+Node1
+
+show_pascal
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::setw
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..466de1306
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..ce1d3bf2c
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+ccfa80a00f865d04a990271c964d5318
\ 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
new file mode 100644
index 000000000..7bdcbede6
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,88 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+pascal_triangle
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+show_pascal
+
+
+
+
+Node1->Node4
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+std::setw
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/dc/d37/lu__decompose_8cpp__incl.map b/dc/d37/lu__decompose_8cpp__incl.map
new file mode 100644
index 000000000..2544e7c25
--- /dev/null
+++ b/dc/d37/lu__decompose_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dc/d37/lu__decompose_8cpp__incl.md5 b/dc/d37/lu__decompose_8cpp__incl.md5
new file mode 100644
index 000000000..d14f77b15
--- /dev/null
+++ b/dc/d37/lu__decompose_8cpp__incl.md5
@@ -0,0 +1 @@
+0aaf50ef77094991d705b3bba1630939
\ No newline at end of file
diff --git a/dc/d37/lu__decompose_8cpp__incl.svg b/dc/d37/lu__decompose_8cpp__incl.svg
new file mode 100644
index 000000000..2f08e9c80
--- /dev/null
+++ b/dc/d37/lu__decompose_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+numerical_methods/lu_decompose.cpp
+
+Node1
+
+numerical_methods/lu
+_decompose.cpp
+
+
+
+
+Node2
+
+ctime
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iomanip
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html
new file mode 100644
index 000000000..c412f08cd
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html
@@ -0,0 +1,994 @@
+
+
+
+Algorithms_in_C++: numerical_methods/ordinary_least_squares_regressor.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Linear regression example using Ordinary least squares
+More...
+
#include <iomanip>#include <iostream>#include <vector>
+template<typename T > std::ostream & operator<< (std::ostream &out, std::vector < std::vector < T >> const &v) template<typename T > std::ostream & operator<< (std::ostream &out, std::vector < T > const &v) template<typename T > bool is_square (std::vector < std::vector < T >> const &A) template<typename T > std::vector < std::vector < T > > operator* (std::vector < std::vector < T >> const &A, std::vector < std::vector < T >> const &B) template<typename T > std::vector < T > operator* (std::vector < std::vector < T >> const &A, std::vector < T > const &B) template<typename T > std::vector < float > operator* (float const scalar, std::vector < T > const &A) template<typename T > std::vector < float > operator* (std::vector < T > const &A, float const scalar) template<typename T > std::vector < float > operator/ (std::vector < T > const &A, float const scalar) template<typename T > std::vector < T > operator- (std::vector < T > const &A, std::vector < T > const &B) template<typename T > std::vector < T > operator+ (std::vector < T > const &A, std::vector < T > const &B) template<typename T > std::vector < std::vector < float > > get_inverse (std::vector < std::vector < T >> const &A) template<typename T > std::vector < std::vector < T > > get_transpose (std::vector < std::vector < T >> const &A) template<typename T > std::vector < float > fit_OLS_regressor (std::vector < std::vector < T >> const &X, std::vector < T > const &Y) template<typename T > std::vector < float > predict_OLS_regressor (std::vector < std::vector < T >> const &X, std::vector < float > const &beta) int main ()
+
+
Linear regression example using Ordinary least squares
+
Author Krishna Vedala 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.
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Perform Ordinary Least Squares curve fit. This operation is defined as
+\[\beta = \left(X^TXX^T\right)Y\]
+
+
Parameters
+
+ X feature matrix with rows representing sample vector of features Y known regression value for each sample
+
+
+
Returns fitted regression model polynomial coefficients
+
+
+
+
313 for (
size_t i = 0; i < X2.
size (); i++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Get matrix inverse using Row-trasnformations. Given matrix must be a square and non-singular.
Returns inverse matrix
+
+
+
+
+
+
223 for (
size_t row = 0; row < N; row++) {
+
+
+
226 for (
size_t col = 0; col < N; col++)
+
227 inverse[row][col] = (row == col) ? 1.f : 0.f;
+
+
+
+
+
+
+
+
+
+
237 for (
size_t row = 0; row < N; row++) {
+
+
239 for (
size_t col = 0; col < N; col++)
+
240 v[col] =
static_cast< float > (A[row][col]);
+
+
+
+
+
245 for (
size_t row = 0; row < N; row++) {
+
246 for (
size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
+
+
248 temp[row] = temp[row] + temp[row2];
+
249 inverse[row] = inverse[row] + inverse[row2];
+
+
+
252 for (
size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
+
+
254 for (
size_t row2 = 0; row2 < N; row2++) {
+
255 temp[row2][row] = temp[row2][row] + temp[row2][col2];
+
256 inverse[row2][row] = inverse[row2][row] + inverse[row2][col2];
+
+
+
+
260 if (temp[row][row] == 0) {
+
+
+
+
+
+
+
267 float divisor =
static_cast< float > (temp[row][row]);
+
268 temp[row] = temp[row] / divisor;
+
269 inverse[row] = inverse[row] / divisor;
+
+
271 for (
size_t row2 = 0; row2 < N; row2++) {
+
+
+
274 float factor = temp[row2][row];
+
275 temp[row2] = temp[row2] - factor * temp[row];
+
276 inverse[row2] = inverse[row2] - factor * inverse[row];
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
matrix transpose
Returns resultant matrix
+
+
+
+
292 for (
size_t row = 0; row < A[0].
size (); row++) {
+
+
294 for (
size_t col = 0; col < A.
size (); col++) v[col] = A[col][row];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
function to check if given matrix is a square matrix
Returns 1 if true, 0 if false
+
+
+
+
57 for (
size_t i = 0; i < N; i++)
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
+
360 std::cout <<
"Enter number of features: " ;
+
+
+
363 std::cout <<
"Enter number of samples: " ;
+
+
+
+
+
+
+
+
371 <<
"Enter training data. Per sample, provide features ad one output."
+
+
+
374 for (
size_t rows = 0; rows < N; rows++) {
+
+
376 std::cout <<
"Sample# " << rows + 1 <<
": " ;
+
377 for (
size_t cols = 0; cols < F; cols++)
+
+
+
+
+
+
+
+
+
+
+
+
389 std::cout <<
"Enter number of test samples: " ;
+
+
+
+
+
+
395 for (
size_t rows = 0; rows < T; rows++) {
+
396 std::cout <<
"Sample# " << rows + 1 <<
": " ;
+
+
398 for (
size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [1/4]
+
+
+
+
+template<typename T >
+
+
+ std::vector <float> operator* (
+ float const
+ scalar ,
+
+ std::vector < T > const & A
+
+ )
+
+
+
+
pre-multiplication of a vector by a scalar
Returns resultant vector
+
+
+
132 size_t N_A = A.
size ();
+
+
+
+
136 for (
size_t row = 0; row < N_A; row++) {
+
137 result[row] += A[row] *
static_cast< float > (scalar);
+
+
+
+
+
+
+
+
+
+
+
◆ [2/4]
+
+
+
+
+template<typename T >
+
+
+
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)
+
Returns resultant matrix
+
+
+
74 size_t N_A = A.
size ();
+
+
76 size_t N_B = B[0].
size ();
+
+
+
+
80 if (A[0].size() != B.
size ()) {
+
81 std::cerr <<
"Number of columns in A != Number of rows in B ("
+
+
+
+
+
86 for (
size_t row = 0; row < N_A; row++) {
+
+
88 for (
size_t col = 0; col < N_B; col++) {
+
89 v[col] =
static_cast< T
> (0);
+
90 for (
size_t j = 0; j < B.
size (); j++)
+
91 v[col] += A[row][j] * B[j][col];
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [3/4]
+
+
+
+
+template<typename T >
+
+
+
multiplication of a matrix with a column vector
Returns resultant vector
+
+
+
107 size_t N_A = A.
size ();
+
+
+
+
111 if (A[0].size() != B.
size ()) {
+
112 std::cerr <<
"Number of columns in A != Number of rows in B ("
+
+
+
+
+
117 for (
size_t row = 0; row < N_A; row++) {
+
118 result[row] =
static_cast< T
> (0);
+
119 for (
size_t j = 0; j < B.
size (); j++) result[row] += A[row][j] * B[j];
+
+
+
+
+
+
+
+
+
+
+
◆ [4/4]
+
+
+
+
+template<typename T >
+
+
+ std::vector <float> operator* (
+ std::vector < T > const & A ,
+
+ float const
+ scalar
+
+ )
+
+
+
+
post-multiplication of a vector by a scalar
Returns resultant vector
+
+
+
150 size_t N_A = A.
size ();
+
+
+
+
154 for (
size_t row = 0; row < N_A; row++)
+
155 result[row] = A[row] *
static_cast< float > (scalar);
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
addition of two vectors of identical lengths
Returns resultant vector
+
+
+
+
+
+
+
+
+
+
+
+
206 for (
size_t row = 0; row < N; row++) result[row] = A[row] + B[row];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
subtraction of two vectors of identical lengths
Returns resultant vector
+
+
+
+
+
+
+
+
+
+
+
+
185 for (
size_t row = 0; row < N; row++) result[row] = A[row] - B[row];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ std::vector <float> operator/ (
+ std::vector < T > const & A ,
+
+ float const
+ scalar
+
+ )
+
+
+
+
division of a vector by a scalar
Returns resultant vector
+
+
166 return (1.
f / scalar) * A;
+
+
+
+
+
+
◆ [1/2]
+
+
+
+
+template<typename T >
+
+
+
operator to print a matrix
+
+
+
22 const char separator =
' ' ;
+
+
24 for (
size_t row = 0; row < v.size(); row++) {
+
25 for (
size_t col = 0; col < v[row].size(); col++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆ [2/2]
+
+
+
+
+template<typename T >
+
+
+
operator to print a vector
+
+
+
40 const char separator =
' ' ;
+
+
42 for (
size_t row = 0; row < v.size(); row++)
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
Given data and OLS model coeffficients, predict regression estimates. This operation is defined as
+\[y_{\text{row}=i} = \sum_{j=\text{columns}}\beta_j\cdot X_{i,j}\]
+
+
Parameters
+
+ X feature matrix with rows representing sample vector of features beta fitted regression model
+
+
+
Returns vector with regression values for each sample
+
+
+
+
344 for (
size_t rows = 0; rows < X.
size (); rows++) {
+
+
346 result[rows] = beta[X[0].
size ()];
+
347 for (
size_t cols = 0; cols < X[0].size(); cols++)
+
348 result[rows] += beta[cols] * X[rows][cols];
+
+
+
+
+
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:54
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
Definition: ordinary_least_squares_regressor.cpp:339
int data[MAX]
test data
Definition: hash_search.cpp:24
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
Definition: ordinary_least_squares_regressor.cpp:309
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:217
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:288
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5
new file mode 100644
index 000000000..4edbf47a3
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5
@@ -0,0 +1 @@
+2f3b031b202221f1b2541d0dcb9cbcc0
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg
new file mode 100644
index 000000000..b82202df6
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+operator-
+
+Node1
+
+operator-
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map
new file mode 100644
index 000000000..23419073f
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map
@@ -0,0 +1,8 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5
new file mode 100644
index 000000000..c067fc38a
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5
@@ -0,0 +1 @@
+f7cdb2473afd1e28b5b5851eb8c61505
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg
new file mode 100644
index 000000000..5c5fbcd12
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+fit_OLS_regressor
+
+Node1
+
+fit_OLS_regressor
+
+
+
+
+Node2
+
+get_inverse
+
+
+
+
+Node1->Node2
+
+
+
+Node5
+
+get_transpose
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::vector::size
+
+
+
+
+Node1->Node6
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+is_square
+
+
+
+
+Node2->Node4
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map
new file mode 100644
index 000000000..ed0cac802
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5
new file mode 100644
index 000000000..f7eba86af
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5
@@ -0,0 +1 @@
+64cbbb1df5c344a9a2abafce74132318
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg
new file mode 100644
index 000000000..c3386c145
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+operator*
+
+Node1
+
+operator*
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map
new file mode 100644
index 000000000..227f29788
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5
new file mode 100644
index 000000000..781746e2c
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5
@@ -0,0 +1 @@
+d57610d3d7b0c5ac21d89b7326a3a580
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg
new file mode 100644
index 000000000..e7d168d59
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+operator+
+
+Node1
+
+operator+
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::vector::size
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map
new file mode 100644
index 000000000..ef47b80fe
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5
new file mode 100644
index 000000000..56a7ee273
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5
@@ -0,0 +1 @@
+1c8e663a07d91145beb8fb2008e86122
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg
new file mode 100644
index 000000000..dd618ef29
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+get_inverse
+
+Node1
+
+get_inverse
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+is_square
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map
new file mode 100644
index 000000000..1209266bf
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5
new file mode 100644
index 000000000..d8a0506e3
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5
@@ -0,0 +1 @@
+5d572395cc614d4fe8d328f204366b12
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg
new file mode 100644
index 000000000..05f913712
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+operator<<
+
+Node1
+
+operator<<
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::left
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::setfill
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::setw
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map
new file mode 100644
index 000000000..9831e8be5
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5
new file mode 100644
index 000000000..06d8151cb
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5
@@ -0,0 +1 @@
+853180b63c189d061d111dc9113e2b51
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg
new file mode 100644
index 000000000..a13270076
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+operator*
+
+Node1
+
+operator*
+
+
+
+
+Node2
+
+std::vector::size
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map
new file mode 100644
index 000000000..2346a81bb
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5
new file mode 100644
index 000000000..df360d90c
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5
@@ -0,0 +1 @@
+25ec4718e406f531ef8a8f0cb804f843
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg
new file mode 100644
index 000000000..0833db3b2
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+operator<<
+
+Node1
+
+operator<<
+
+
+
+
+Node2
+
+std::left
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::setfill
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::setw
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map
new file mode 100644
index 000000000..4f9b60620
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5
new file mode 100644
index 000000000..4006a112d
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5
@@ -0,0 +1 @@
+bdce570240e0de070c1169e752ba7ecb
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg
new file mode 100644
index 000000000..47ae6dca1
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+operator*
+
+Node1
+
+operator*
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..8a91004f8
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,10 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..ebca49874
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+25d118c3503cf8d09b19ff9b6d6e3e43
\ 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
new file mode 100644
index 000000000..c55679f00
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,133 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+fit_OLS_regressor
+
+
+
+
+Node1->Node3
+
+
+
+Node8
+
+predict_OLS_regressor
+
+
+
+
+Node1->Node8
+
+
+
+Node4
+
+get_inverse
+
+
+
+
+Node3->Node4
+
+
+
+Node6
+
+get_transpose
+
+
+
+
+Node3->Node6
+
+
+
+Node7
+
+std::vector::size
+
+
+
+
+Node3->Node7
+
+
+
+Node4->Node2
+
+
+
+Node5
+
+is_square
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map
new file mode 100644
index 000000000..9831e8be5
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5
new file mode 100644
index 000000000..06d8151cb
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5
@@ -0,0 +1 @@
+853180b63c189d061d111dc9113e2b51
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg
new file mode 100644
index 000000000..a13270076
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+operator*
+
+Node1
+
+operator*
+
+
+
+
+Node2
+
+std::vector::size
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.map b/dc/d43/decimal__to__roman__numeral_8cpp__incl.map
new file mode 100644
index 000000000..4b6bc5a84
--- /dev/null
+++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 b/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5
new file mode 100644
index 000000000..b7001def7
--- /dev/null
+++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5
@@ -0,0 +1 @@
+ca58ebfd7e81a0e7a55b397b4578a0d3
\ No newline at end of file
diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg
new file mode 100644
index 000000000..17c33ee3a
--- /dev/null
+++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+others/decimal_to_roman_numeral.cpp
+
+Node1
+
+others/decimal_to_roman
+_numeral.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdio
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstring
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dc/d5f/qr__decompose_8h__dep__incl.map b/dc/d5f/qr__decompose_8h__dep__incl.map
new file mode 100644
index 000000000..652acda92
--- /dev/null
+++ b/dc/d5f/qr__decompose_8h__dep__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/dc/d5f/qr__decompose_8h__dep__incl.md5 b/dc/d5f/qr__decompose_8h__dep__incl.md5
new file mode 100644
index 000000000..ade939cab
--- /dev/null
+++ b/dc/d5f/qr__decompose_8h__dep__incl.md5
@@ -0,0 +1 @@
+347d5b7e54ed20c88df058a9f53ceadf
\ No newline at end of file
diff --git a/dc/d5f/qr__decompose_8h__dep__incl.svg b/dc/d5f/qr__decompose_8h__dep__incl.svg
new file mode 100644
index 000000000..6a5c0d421
--- /dev/null
+++ b/dc/d5f/qr__decompose_8h__dep__incl.svg
@@ -0,0 +1,55 @@
+
+
+
+
+
+
+numerical_methods/qr_decompose.h
+
+Node1
+
+numerical_methods/qr
+_decompose.h
+
+
+
+
+Node2
+
+numerical_methods/qr
+_decomposition.cpp
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+numerical_methods/qr
+_eigen_values.cpp
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/d93/trie__modern_8cpp.html b/dc/d93/trie__modern_8cpp.html
new file mode 100644
index 000000000..5b504761e
--- /dev/null
+++ b/dc/d93/trie__modern_8cpp.html
@@ -0,0 +1,171 @@
+
+
+
+Algorithms_in_C++: data_structures/trie_modern.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A basic implementation of trie class to store only lower-case strings.
+More...
+
#include <iostream>#include <memory>#include <string>
+
+
A basic implementation of trie class to store only lower-case strings.
+
Copyright 2020
Author Anmol3299
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
163 trie .insert(
"hello" );
+
164 trie .removeWord(
"hel" );
+
+
+
+
+
+
+
+
+
Definition: trie_tree.cpp:8
Definition: trie_modern.cpp:16
Algorithms_in_C++: search/text_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Search for words in a long textual paragraph.
+More...
+
#include <cstdlib>#include <iostream>#include <cstring>
+
+
Search for words in a long textual paragraph.
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
17 std::cout <<
"Please enter your paragraph: \n" ;
+
+
19 std::cout <<
"\nHello, your paragraph is:\n " << paragraph <<
"!\n" ;
+
20 std::cout <<
"\nThe size of your paragraph = " << paragraph.size()
+
21 <<
" characters. \n\n" ;
+
+
23 if (paragraph.empty()) {
+
+
+
+
+
28 std::cout <<
"Please enter the word you are searching for: " ;
+
+
30 std::cout <<
"Hello, your word is " << word <<
"!\n" ;
+
31 if (paragraph.find(word) == std::string::npos) {
+
32 std::cout << word <<
" does not exist in the sentence"
+
+
+
35 std::cout <<
"The word " << word <<
" is now found at location "
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..685159a17
--- /dev/null
+++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+546deebaf429d5e4ac5656f38fbe4024
\ 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
new file mode 100644
index 000000000..af48da736
--- /dev/null
+++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::getline
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.map b/dc/dc5/ode__forward__euler_8cpp__incl.map
new file mode 100644
index 000000000..7d4085f41
--- /dev/null
+++ b/dc/dc5/ode__forward__euler_8cpp__incl.map
@@ -0,0 +1,8 @@
+
+
diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.md5 b/dc/dc5/ode__forward__euler_8cpp__incl.md5
new file mode 100644
index 000000000..c3fc556a6
--- /dev/null
+++ b/dc/dc5/ode__forward__euler_8cpp__incl.md5
@@ -0,0 +1 @@
+6c0133a36ee73621a7d187b5441a2122
\ No newline at end of file
diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.svg b/dc/dc5/ode__forward__euler_8cpp__incl.svg
new file mode 100644
index 000000000..1678aba67
--- /dev/null
+++ b/dc/dc5/ode__forward__euler_8cpp__incl.svg
@@ -0,0 +1,98 @@
+
+
+
+
+
+
+numerical_methods/ode_forward_euler.cpp
+
+Node1
+
+numerical_methods/ode
+_forward_euler.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+fstream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+valarray
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html
new file mode 100644
index 000000000..2a197ff18
--- /dev/null
+++ b/dc/dc5/paranthesis__matching_8cpp.html
@@ -0,0 +1,227 @@
+
+
+
+Algorithms_in_C++: others/paranthesis_matching.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Perform paranthesis matching.
+More...
+
#include <iostream>#include <cstring>
+char opening (char ch) main () char stack [MAX ] top = -1 pointer to track stack index push (char ch) push byte to stack variable pop () pop a byte out of stack variable
+
+
Perform paranthesis matching.
+
Note Do not know the application of this, however.
+
+Implementation is C-type and does not utilize the C++ constructs
+
Todo: implement as a C++ class
+
+
+
◆
+
+
+
+
+
◆
+
+
+
+
+
+ char opening
+ (
+ char
+ ch )
+
+
+
+
return opening paranthesis corresponding to the close paranthesis
Parameters
+
+ [in] ch closed paranthesis character
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
-----------— stack -----------— global stack
+
+
+
+
+
+
diff --git a/dc/de0/fibonacci__large_8cpp__incl.md5 b/dc/de0/fibonacci__large_8cpp__incl.md5
new file mode 100644
index 000000000..49286988b
--- /dev/null
+++ b/dc/de0/fibonacci__large_8cpp__incl.md5
@@ -0,0 +1 @@
+6b39570dbac50617d3c22cd1794ec72a
\ No newline at end of file
diff --git a/dc/de0/fibonacci__large_8cpp__incl.svg b/dc/de0/fibonacci__large_8cpp__incl.svg
new file mode 100644
index 000000000..13bdf3d20
--- /dev/null
+++ b/dc/de0/fibonacci__large_8cpp__incl.svg
@@ -0,0 +1,169 @@
+
+
+
+
+
+
+math/fibonacci_large.cpp
+
+Node1
+
+math/fibonacci_large.cpp
+
+
+
+
+Node2
+
+cinttypes
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ctime
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+./large_number.h
+
+
+
+
+Node1->Node5
+
+
+
+Node5->Node2
+
+
+
+Node5->Node4
+
+
+
+Node6
+
+algorithm
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+cassert
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+cstring
+
+
+
+
+Node5->Node8
+
+
+
+Node9
+
+type_traits
+
+
+
+
+Node5->Node9
+
+
+
+Node10
+
+vector
+
+
+
+
+Node5->Node10
+
+
+
diff --git a/dc/de2/false__position_8cpp__incl.map b/dc/de2/false__position_8cpp__incl.map
new file mode 100644
index 000000000..5ae67bde1
--- /dev/null
+++ b/dc/de2/false__position_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dc/de2/false__position_8cpp__incl.md5 b/dc/de2/false__position_8cpp__incl.md5
new file mode 100644
index 000000000..b1e8b238f
--- /dev/null
+++ b/dc/de2/false__position_8cpp__incl.md5
@@ -0,0 +1 @@
+af7e510fea5907e77434a402cd0066d5
\ No newline at end of file
diff --git a/dc/de2/false__position_8cpp__incl.svg b/dc/de2/false__position_8cpp__incl.svg
new file mode 100644
index 000000000..79de17876
--- /dev/null
+++ b/dc/de2/false__position_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+numerical_methods/false_position.cpp
+
+Node1
+
+numerical_methods/false
+_position.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdlib
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+limits
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html
new file mode 100644
index 000000000..4ded930f6
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp.html
@@ -0,0 +1,461 @@
+
+
+
+Algorithms_in_C++: search/ternary_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Ternary search algorithm
+More...
+
#include <iostream>
+
+
Ternary search algorithm
+
This is a divide and conquer algorithm. It does this by dividing the search space by 3 parts and using its property (usually monotonic property) to find the desired index.
+
+Time Complexity : O(log3 n)
+Space Complexity : O(1) (without the array)
+
+
+
+
◆
+
+
+
+
+
+ #define _target 10
+
+
+
+
The value of _target should be decided or can be decided later by using the variable of the function.
+
+
+
+
+
◆
+
+
+
+
+
+ #define absolutePrecision 10
+
+
+
+
The absolutePrecision can be modified to fit preference but it is recommended to not go lower than 10 due to errors that may occur.
+
+
+
+
+
+
◆
+
+
+
+
+
+ void get_input
+ (
+ )
+
+
+
+
get_input function is to receive input from standard IO
Todo: @christianbender Get input from STDIO or write input to memory as done above.
+
+
+
+
+
◆
+
+
+
+
+
+ int it_ternary_search
+ (
+ int
+ left ,
+
+ int
+ right ,
+
+ int
+ A [],
+
+ int
+ target
+
+ )
+
+
+
+
This is the iterative method of the ternary search which returns the index of the element.
Parameters
+
+ [in] left lower interval limit [in] right upper interval limit [in] A array to search in [in] target value to search for
+
+
+
Returns index where the target value was found
+
+-1 if target value not found
+
+
+
+
+
52 for (
int i = left; i <=
right ; i++)
+
+
+
+
+
+
+
+
60 int twoThird = (
left +
right ) * 2 / 3 + 1;
+
+
62 if (A[oneThird] == target)
+
+
64 else if (A[twoThird] == target)
+
+
+
67 else if (target > A[twoThird])
+
+
69 else if (target < A[oneThird])
+
+
+
+
73 left = oneThird + 1,
right = twoThird - 1;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
136 int A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int rec_ternary_search
+ (
+ int
+ left ,
+
+ int
+ right ,
+
+ int
+ A [],
+
+ int
+ target
+
+ )
+
+
+
+
This is the recursive method of the ternary search which returns the index of the element.
Parameters
+
+ [in] left lower interval limit [in] right upper interval limit [in] A array to search in [in] target value to search for
+
+
+
Returns index where the target value was found
+
+-1 if target value not found
+
+
+
+
93 for (
int i = left; i <=
right ; i++)
+
+
+
+
+
+
+
+
101 int twoThird = (
left +
right ) * 2 / 3 + 1;
+
+
103 if (A[oneThird] == target)
+
+
105 if (A[twoThird] == target)
+
+
+
108 if (target < A[oneThird])
+
+
110 if (target > A[twoThird])
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void ternary_search
+ (
+ int
+ N ,
+
+ int
+ A [],
+
+ int
+ target
+
+ )
+
+
+
+
ternary_search is a template function You could either use it_ternary_search or rec_ternary_search according to preference.
Parameters
+
+ [in] N length of array [in] A array to search in [in] target value to search for
+
+
+
+
+
+
+
+
+
void ternary_search(int N, int A[], int target)
Definition: ternary_search.cpp:127
#define absolutePrecision
Definition: ternary_search.cpp:22
int rec_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:90
#define _target
Definition: ternary_search.cpp:27
int it_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:48
void get_input()
Definition: ternary_search.cpp:36
+
diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..8e7f84a9f
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+621cd897edea0804f61d86b01ad1a90d
\ 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
new file mode 100644
index 000000000..1b73e0e56
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+get_input
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+ternary_search
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+it_ternary_search
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+rec_ternary_search
+
+
+
+
+Node3->Node6
+
+
+
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map
new file mode 100644
index 000000000..895f9d368
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5
new file mode 100644
index 000000000..aecc25c72
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5
@@ -0,0 +1 @@
+3749349ab9e91b8cbe42eb831fccdd9f
\ 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
new file mode 100644
index 000000000..84dae2cb3
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+ternary_search
+
+Node1
+
+ternary_search
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+it_ternary_search
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+rec_ternary_search
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/dd/d00/class_queue-members.html b/dd/d00/class_queue-members.html
new file mode 100644
index 000000000..c6f420350
--- /dev/null
+++ b/dd/d00/class_queue-members.html
@@ -0,0 +1,118 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Queue , including all inherited members.
+
+
+
diff --git a/dd/d0e/double__factorial_8cpp__incl.md5 b/dd/d0e/double__factorial_8cpp__incl.md5
new file mode 100644
index 000000000..1d4164467
--- /dev/null
+++ b/dd/d0e/double__factorial_8cpp__incl.md5
@@ -0,0 +1 @@
+ee60764944201d6cf3f6571ad0be0d7d
\ No newline at end of file
diff --git a/dd/d0e/double__factorial_8cpp__incl.svg b/dd/d0e/double__factorial_8cpp__incl.svg
new file mode 100644
index 000000000..05f08e2a7
--- /dev/null
+++ b/dd/d0e/double__factorial_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/double_factorial.cpp
+
+Node1
+
+math/double_factorial.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dd/d0f/text__search_8cpp__incl.map b/dd/d0f/text__search_8cpp__incl.map
new file mode 100644
index 000000000..09c75be7f
--- /dev/null
+++ b/dd/d0f/text__search_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/dd/d0f/text__search_8cpp__incl.md5 b/dd/d0f/text__search_8cpp__incl.md5
new file mode 100644
index 000000000..42c8682b7
--- /dev/null
+++ b/dd/d0f/text__search_8cpp__incl.md5
@@ -0,0 +1 @@
+fd3cff2d5c9ddc6ee71f7ee4179cb735
\ No newline at end of file
diff --git a/dd/d0f/text__search_8cpp__incl.svg b/dd/d0f/text__search_8cpp__incl.svg
new file mode 100644
index 000000000..fd8972f4f
--- /dev/null
+++ b/dd/d0f/text__search_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+search/text_search.cpp
+
+Node1
+
+search/text_search.cpp
+
+
+
+
+Node2
+
+cstdlib
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstring
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html
new file mode 100644
index 000000000..c76201861
--- /dev/null
+++ b/dd/d1b/structquery.html
@@ -0,0 +1,128 @@
+
+
+
+Algorithms_in_C++: query Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+l r i
+
The documentation for this struct was generated from the following file:
+
+
Algorithms_in_C++: numerical_methods/false_position.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve the equation \(f(x)=0\) using false position method , also known as the Secant method.
+More...
+
#include <cmath>#include <cstdlib>#include <iostream>#include <limits>
+EPSILON 1e-6 MAX_ITERATIONS 50000 Maximum number of iterations to check.
+static double eq (double i) template<typename T > int sgn (T val) int main ()
+
+
Solve the equation \(f(x)=0\) using false position method , also known as the Secant method.
+
Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)} \]
+
+
For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.
+
See also newton_raphson_method.cpp , bisection_method.cpp
+
+
+
◆
+
+
+
+
+
+
+
+
+ static double eq
+ (
+ double
+ i )
+
+
+
+
+static
+
+
+
+
define \(f(x)\) to find root for
+
+
29 return (
std::pow (i, 3) - (4 * i) - 9);
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
40 double a = -1, b = 1, x, z, m, n, c;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
62 c = ((
a * n) - (b * m)) / (n - m);
+
+
+
+
+
67 if (std::abs(z) < EPSILON) {
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+ int sgn
+ (
+ T
+ val )
+
+
+
+
get the sign of any given number
+
+
35 return (T(0) < val) - (val < T(0));
+
+
+
+
+
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
int sgn(T val)
Definition: false_position.cpp:34
vector< ll > a
Definition: matrix_exponentiation.cpp:53
static double eq(double i)
Definition: false_position.cpp:28
+
diff --git a/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
new file mode 100644
index 000000000..ecfa65278
--- /dev/null
+++ b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
@@ -0,0 +1 @@
+ebb04cd15e67d7a7b151a478105c7fad
\ No newline at end of file
diff --git a/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
new file mode 100644
index 000000000..c3eea1476
--- /dev/null
+++ b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+eq
+
+Node1
+
+eq
+
+
+
+
+Node2
+
+std::pow
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html
new file mode 100644
index 000000000..608aa647f
--- /dev/null
+++ b/dd/d2f/class_trie.html
@@ -0,0 +1,414 @@
+
+
+
+Algorithms_in_C++: Trie Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ALPHABETS = 26
+
+
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.
+
+
+
◆
+
+
+
+
+
+
+
+
+
+inline static private
+
+
+
+
Function to check if a node has some children which can form words.
Parameters
+
+ node whose character array of pointers need to be checked for children.
+
+
+
Returns true if a child is found
+false if a child is not found
+
+
42 for (
size_t i = 0; i < ALPHABETS; i++) {
+
43 if (
node ->character[i]) {
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ void Trie::insert
+ (
+ const std::string &
+ word )
+
+
+
+
+inline
+
+
+
+
Insert a word into the trie.
Parameters
+
+ word which needs to be inserted into the string.
+
+
+
+
+
111 for (
char ch : word) {
+
112 size_t index = ch -
'a' ;
+
+
+
+
116 if (!curr->character[index]) {
+
117 curr->character[index] = std::make_shared<TrieNode>();
+
+
+
120 curr = curr->character[index];
+
+
122 curr->isEndOfWord =
true ;
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+
+inline private
+
+
+
+
A recursive helper function to remove a word from the trie. First, it recursively traverses to the location of last character of word in the trie. However, if the word is not found, the function returns a runtime error. Upon successfully reaching the last character of word in trie, if sets the isEndOfWord to false and deletes the node if and only if it has no children, else it returns the current node.
Parameters
+
+ word is the string which needs to be removed from trie. curr is the current node we are at. index is the index of the @word we are at.
+
+
+
Returns if current node has childern, it returns @ curr, else it returns nullptr.
+
Exceptions
+
+ a runtime error in case @ word is not found in the trie.
+
+
+
+
67 if (word.
size () == index) {
+
68 if (curr->isEndOfWord) {
+
69 curr->isEndOfWord =
false ;
+
+
+
+
+
+
+
+
77 size_t idx = word[index] -
'a' ;
+
+
+
+
81 if (!curr->character[idx]) {
+
+
+
+
85 curr->character[idx] =
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ bool Trie::search
+ (
+ const std::string &
+ word )
+
+
+
+
+inline
+
+
+
+
Search if a word is present in trie or not.
Parameters
+
+ word which is needed to be searched in the trie.
+
+
+
Returns True if the word is found in trie and isEndOfWord is set to true.
+
+False if word is not found in trie or isEndOfWord is set to false.
+
+
+
134 for (
char ch : word) {
+
135 size_t index = ch -
'a' ;
+
+
+
+
139 if (!curr->character[index]) {
+
+
+
142 curr = curr->character[index];
+
+
144 return curr->isEndOfWord;
+
+
+
+
+
The documentation for this class was generated from the following file:
+
+
static bool hasChildren(std::shared_ptr< TrieNode > node)
Definition: trie_modern.cpp:41
Definition: avltree.cpp:13
std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
Definition: trie_modern.cpp:64
+
diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5
new file mode 100644
index 000000000..0e9379408
--- /dev/null
+++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5
@@ -0,0 +1 @@
+78be4e71e977b5dce6cdfc91a3a722ec
\ No newline at end of file
diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg
new file mode 100644
index 000000000..08f591b0c
--- /dev/null
+++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+Trie::removeWordHelper
+
+Node1
+
+Trie::removeWordHelper
+
+
+
+
+Node2
+
+Trie::hasChildren
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::move
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::string::size
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.map b/dd/d30/matrix__exponentiation_8cpp__incl.map
new file mode 100644
index 000000000..3ebaa83b6
--- /dev/null
+++ b/dd/d30/matrix__exponentiation_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.md5 b/dd/d30/matrix__exponentiation_8cpp__incl.md5
new file mode 100644
index 000000000..680bb3397
--- /dev/null
+++ b/dd/d30/matrix__exponentiation_8cpp__incl.md5
@@ -0,0 +1 @@
+0682b4368c5373318d2d76ce2a7a30af
\ No newline at end of file
diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.svg b/dd/d30/matrix__exponentiation_8cpp__incl.svg
new file mode 100644
index 000000000..b875c5f4d
--- /dev/null
+++ b/dd/d30/matrix__exponentiation_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+others/matrix_exponentiation.cpp
+
+Node1
+
+others/matrix_exponentiation.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+vector
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dd/d3b/struct_entry.html b/dd/d3b/struct_entry.html
new file mode 100644
index 000000000..1367a4440
--- /dev/null
+++ b/dd/d3b/struct_entry.html
@@ -0,0 +1,137 @@
+
+
+
+Algorithms_in_C++: Entry Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Entry (int key=notPresent) Entry (int key=notPresent) Entry (int key=notPresent)
+
The documentation for this struct was generated from the following files:
+hashing/double_hash_hash_table.cpp
+hashing/linear_probing_hash_table.cpp
+hashing/quadratic_probing_hash_table.cpp
+
+
+
Algorithms_in_C++: Solution Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+dfs (int current_node, int parent)
+
The documentation for this class was generated from the following file:
+graph/bridge_finding_with_tarjan_algorithm.cpp
+
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for stack< Type > , including all inherited members.
+
+
Algorithms_in_C++: numerical_methods/lu_decompose.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
LU decomposition of a square matrix
+More...
+
#include <ctime>#include <iomanip>#include <iostream>#include <vector>
+
+
+
+
◆
+
+
+
+
Perform LU decomposition on matrix
Parameters
+
+ [in] A matrix to decompose [out] L output L matrix [out] U output U matrix
+
+
+
Returns 0 if no errors
+
+negative if error occurred
+
+
+
26 int mat_size = A.
size ();
+
+
28 if (mat_size != A[0].size()) {
+
+
+
+
+
+
+
35 for (row = 0; row < mat_size; row++) {
+
+
+
+
+
40 for (col = row; col < mat_size; col++) {
+
+
+
43 for (j = 0; j < row; j++) lu_sum += L[0][row][j] * U[0][j][col];
+
+
+
46 U[0][row][col] = A[row][col] - lu_sum;
+
+
+
+
+
+
+
53 for (col = row; col < mat_size; col++) {
+
+
+
+
+
+
+
+
61 for (j = 0; j < row; j++) lu_sum += L[0][col][j] * U[0][j][row];
+
+
+
64 L[0][col][row] = (A[col][row] - lu_sum) / U[0][row][row];
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
Main function
+
+
+
+
94 const int range2 = range >> 1;
+
+
+
97 mat_size =
atoi (argv[1]);
+
+
+
+
+
+
+
+
105 for (
int i = 0; i < mat_size; i++) {
+
+
+
+
+
110 for (
int j = 0; j < mat_size; j++)
+
+
112 A[i][j] =
static_cast< double > (
std::rand () % range - range2);
+
+
+
+
+
+
+
119 <<
static_cast< double > (end_t - start_t) / CLOCKS_PER_SEC <<
"\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+template<typename T >
+
+
+
operator to print a matrix
+
+
+
78 const char separator =
' ' ;
+
+
80 for (
size_t row = 0; row < v.size(); row++) {
+
81 for (
size_t col = 0; col < v[row].size(); col++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int lu_decomposition(const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
Definition: lu_decompose.cpp:22
+
diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..2b6697b29
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+6acf1104da2f83975f57075289c5c6d4
\ 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
new file mode 100644
index 000000000..e8e03477d
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::clock
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+lu_decomposition
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::rand
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::srand
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+std::time
+
+
+
+
+Node1->Node6
+
+
+
diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map
new file mode 100644
index 000000000..1209266bf
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5
new file mode 100644
index 000000000..d8a0506e3
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5
@@ -0,0 +1 @@
+5d572395cc614d4fe8d328f204366b12
\ No newline at end of file
diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg
new file mode 100644
index 000000000..05f913712
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+operator<<
+
+Node1
+
+operator<<
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::left
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+std::setfill
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::setw
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/dd/d75/structqueue__coll__graph.map b/dd/d75/structqueue__coll__graph.map
new file mode 100644
index 000000000..c157e0f51
--- /dev/null
+++ b/dd/d75/structqueue__coll__graph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dd/d75/structqueue__coll__graph.md5 b/dd/d75/structqueue__coll__graph.md5
new file mode 100644
index 000000000..30c0758b8
--- /dev/null
+++ b/dd/d75/structqueue__coll__graph.md5
@@ -0,0 +1 @@
+1bf827d546df1c288156db7012f4b791
\ No newline at end of file
diff --git a/dd/d75/structqueue__coll__graph.svg b/dd/d75/structqueue__coll__graph.svg
new file mode 100644
index 000000000..4516d62ca
--- /dev/null
+++ b/dd/d75/structqueue__coll__graph.svg
@@ -0,0 +1,49 @@
+
+
+
+
+
+
+queue< Kind >
+
+Node1
+
+queue< Kind >
+
+
+
+
+Node2
+
+node< Kind >
+
+
+
+
+Node2->Node1
+ t
+
+
+
+Node2->Node2
+ prev
+next
+right
+left
+link
+
+
+
diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html
new file mode 100644
index 000000000..da8b017dd
--- /dev/null
+++ b/dd/d7a/classdouble__linked__list-members.html
@@ -0,0 +1,117 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for double_linked_list , including all inherited members.
+
+
+
diff --git a/dd/d7f/classstack__linked_list__coll__graph.md5 b/dd/d7f/classstack__linked_list__coll__graph.md5
new file mode 100644
index 000000000..38a8f6905
--- /dev/null
+++ b/dd/d7f/classstack__linked_list__coll__graph.md5
@@ -0,0 +1 @@
+8b35d1d619df1f0232b29335c0c85ccc
\ No newline at end of file
diff --git a/dd/d7f/classstack__linked_list__coll__graph.svg b/dd/d7f/classstack__linked_list__coll__graph.svg
new file mode 100644
index 000000000..add546db3
--- /dev/null
+++ b/dd/d7f/classstack__linked_list__coll__graph.svg
@@ -0,0 +1,46 @@
+
+
+
+
+
+
+stack_linkedList
+
+Node1
+
+stack_linkedList
+
+
+
+
+Node2
+
+linkedlist
+
+
+
+
+Node2->Node1
+ front
+rear
+
+
+
+Node2->Node2
+ next
+
+
+
diff --git a/dd/d82/large__number_8h__incl.map b/dd/d82/large__number_8h__incl.map
new file mode 100644
index 000000000..a0ab6ef76
--- /dev/null
+++ b/dd/d82/large__number_8h__incl.map
@@ -0,0 +1,10 @@
+
+
diff --git a/dd/d82/large__number_8h__incl.md5 b/dd/d82/large__number_8h__incl.md5
new file mode 100644
index 000000000..c08b08e3e
--- /dev/null
+++ b/dd/d82/large__number_8h__incl.md5
@@ -0,0 +1 @@
+4c99f4059fe90907c6da5e1b7b904c77
\ No newline at end of file
diff --git a/dd/d82/large__number_8h__incl.svg b/dd/d82/large__number_8h__incl.svg
new file mode 100644
index 000000000..3bda990ef
--- /dev/null
+++ b/dd/d82/large__number_8h__incl.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+math/large_number.h
+
+Node1
+
+math/large_number.h
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cassert
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cinttypes
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstring
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+iostream
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+type_traits
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+vector
+
+
+
+
+Node1->Node8
+
+
+
diff --git a/dd/d86/shell__sort2_8cpp__incl.map b/dd/d86/shell__sort2_8cpp__incl.map
new file mode 100644
index 000000000..82c2ec1cf
--- /dev/null
+++ b/dd/d86/shell__sort2_8cpp__incl.map
@@ -0,0 +1,9 @@
+
+
diff --git a/dd/d86/shell__sort2_8cpp__incl.md5 b/dd/d86/shell__sort2_8cpp__incl.md5
new file mode 100644
index 000000000..d5ff8c0fb
--- /dev/null
+++ b/dd/d86/shell__sort2_8cpp__incl.md5
@@ -0,0 +1 @@
+0cbb687b07e8b9802dfd83b28eb22377
\ No newline at end of file
diff --git a/dd/d86/shell__sort2_8cpp__incl.svg b/dd/d86/shell__sort2_8cpp__incl.svg
new file mode 100644
index 000000000..5a8bc05bc
--- /dev/null
+++ b/dd/d86/shell__sort2_8cpp__incl.svg
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+sorting/shell_sort2.cpp
+
+Node1
+
+sorting/shell_sort2.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdlib
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+ctime
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+iostream
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+utility
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+vector
+
+
+
+
+Node1->Node7
+
+
+
diff --git a/dd/d9b/classgraph.html b/dd/d9b/classgraph.html
new file mode 100644
index 000000000..518ffcdc1
--- /dev/null
+++ b/dd/d9b/classgraph.html
@@ -0,0 +1,173 @@
+
+
+
+Algorithms_in_C++: graph Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+graph (int v) addedge (int src, int dest) printgraph () bfs (int s) graph (int n) addEdge (int, int) getConnectedComponents ()
+depth_first_search () explore (int, vector < bool > &)
+v list < int > * adj vector < vector < int > > adj connected_components
+
The documentation for this class was generated from the following files:
+graph/bfs.cpp
+graph/connected_components.cpp
+
+
+
Algorithms_in_C++: Todo List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+File avltree.cpp
+File binary_search_tree.cpp
+Member k
+Member a
+File paranthesis_matching.cpp
+Member test3 ()
+File hash_search.cpp
+Member create_list (int key)
+Member comp (X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3)
+Member get_input ()
+
+
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for SegmentIntersection , including all inherited members.
+
+
+
diff --git a/dd/df3/line__segment__intersection_8cpp__incl.md5 b/dd/df3/line__segment__intersection_8cpp__incl.md5
new file mode 100644
index 000000000..a6b32c340
--- /dev/null
+++ b/dd/df3/line__segment__intersection_8cpp__incl.md5
@@ -0,0 +1 @@
+f9a2b4778dfb0f860bce23d9c2ae7421
\ No newline at end of file
diff --git a/dd/df3/line__segment__intersection_8cpp__incl.svg b/dd/df3/line__segment__intersection_8cpp__incl.svg
new file mode 100644
index 000000000..c2ea5e193
--- /dev/null
+++ b/dd/df3/line__segment__intersection_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+geometry/line_segment_intersection.cpp
+
+Node1
+
+geometry/line_segment
+_intersection.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/dd/df4/structlca.html b/dd/df4/structlca.html
new file mode 100644
index 000000000..88dd08c42
--- /dev/null
+++ b/dd/df4/structlca.html
@@ -0,0 +1,156 @@
+
+
+
+Algorithms_in_C++: lca Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+lca (int n_) verify () build () dfs (int node , int par) query (int u, int v)
+n vector < int > adj [N] up [LG][N] level [N]
+
The documentation for this struct was generated from the following file:
+
+
+
diff --git a/dd/df5/poisson__dist_8cpp__incl.md5 b/dd/df5/poisson__dist_8cpp__incl.md5
new file mode 100644
index 000000000..cd096c7b8
--- /dev/null
+++ b/dd/df5/poisson__dist_8cpp__incl.md5
@@ -0,0 +1 @@
+697116b0b93ccca5b82c3a4e65bbae25
\ No newline at end of file
diff --git a/dd/df5/poisson__dist_8cpp__incl.svg b/dd/df5/poisson__dist_8cpp__incl.svg
new file mode 100644
index 000000000..161231223
--- /dev/null
+++ b/dd/df5/poisson__dist_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+probability/poisson_dist.cpp
+
+Node1
+
+probability/poisson
+_dist.cpp
+
+
+
+
+Node2
+
+cmath
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/de/d36/binary__exponent_8cpp__incl.map b/de/d36/binary__exponent_8cpp__incl.map
new file mode 100644
index 000000000..96dd88f9d
--- /dev/null
+++ b/de/d36/binary__exponent_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/de/d36/binary__exponent_8cpp__incl.md5 b/de/d36/binary__exponent_8cpp__incl.md5
new file mode 100644
index 000000000..265b0716d
--- /dev/null
+++ b/de/d36/binary__exponent_8cpp__incl.md5
@@ -0,0 +1 @@
+002ac0bc1547bbb735ceb81b0e22c026
\ No newline at end of file
diff --git a/de/d36/binary__exponent_8cpp__incl.svg b/de/d36/binary__exponent_8cpp__incl.svg
new file mode 100644
index 000000000..789cd1758
--- /dev/null
+++ b/de/d36/binary__exponent_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+math/binary_exponent.cpp
+
+Node1
+
+math/binary_exponent.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html
new file mode 100644
index 000000000..6b9f34cbe
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp.html
@@ -0,0 +1,295 @@
+
+
+
+Algorithms_in_C++: math/string_fibonacci.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This Programme returns the Nth fibonacci as a string.
+More...
+
#include <iostream>#include <cstring>
+
+
This Programme returns the Nth fibonacci as a string.
+
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
+
See also fibonacci_large.cpp , fibonacci_fast.cpp , fibonacci.cpp
+
+
+
◆
+
+
+
+
function to add two string numbers
Parameters
+
+ [in] a first number in string to add [in] b second number in string to add
+
+
+
Returns sum as a std::string
+
+
+
+
+
+
+
+
31 while (
a .length() < b.length()) {
+
+
+
+
+
36 while (b.length() <
a .length()) {
+
+
+
+
+
41 for (
int i =
a .length() - 1; i >= 0; i--) {
+
42 char val =
static_cast< char > (((
a [i] - 48) + (b[i] - 48)) + 48 + carry);
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
58 while (temp[0] ==
'0' && temp.
length () > 1) {
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void fib_Accurate
+ (
+ uint64_t
+ n )
+
+
+
+
Fibonacci iterator
Parameters
+
+ [in] n n^th Fibonacci number
+
+
+
+
+
+
+
72 for (uint64_t i = 0; i < n; i++) {
+
73 tmp =
add (fibMinus1, fibMinus2);
+
74 fibMinus2 = fibMinus1;
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
83 std::cout <<
"Enter whatever number N you want to find the fibonacci of\n" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
+
diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5
new file mode 100644
index 000000000..a82748172
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5
@@ -0,0 +1 @@
+eb015093a376f4430734c10122881316
\ 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
new file mode 100644
index 000000000..3c845654e
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+fib_Accurate
+
+Node1
+
+fib_Accurate
+
+
+
+
+Node2
+
+add
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..4fba517a3
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..1c57898db
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+7d416f84c9f950a685ee14d9fe01088e
\ 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
new file mode 100644
index 000000000..cf4f1fe51
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+fib_Accurate
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+add
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html
new file mode 100644
index 000000000..672d07495
--- /dev/null
+++ b/de/d48/struct_trie_1_1_trie_node.html
@@ -0,0 +1,133 @@
+
+
+
+Algorithms_in_C++: Trie::TrieNode Struct Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
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.
+
The documentation for this struct was generated from the following file:
+
+
+
diff --git a/de/d5b/eulers__totient__function_8cpp__incl.md5 b/de/d5b/eulers__totient__function_8cpp__incl.md5
new file mode 100644
index 000000000..208a85ccf
--- /dev/null
+++ b/de/d5b/eulers__totient__function_8cpp__incl.md5
@@ -0,0 +1 @@
+8a9a85f66dd59a18bd52880d6677089e
\ No newline at end of file
diff --git a/de/d5b/eulers__totient__function_8cpp__incl.svg b/de/d5b/eulers__totient__function_8cpp__incl.svg
new file mode 100644
index 000000000..414a3825e
--- /dev/null
+++ b/de/d5b/eulers__totient__function_8cpp__incl.svg
@@ -0,0 +1,53 @@
+
+
+
+
+
+
+math/eulers_totient_function.cpp
+
+Node1
+
+math/eulers_totient
+_function.cpp
+
+
+
+
+Node2
+
+cstdlib
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.map b/de/d69/knuth__morris__pratt_8cpp__incl.map
new file mode 100644
index 000000000..ac98e98da
--- /dev/null
+++ b/de/d69/knuth__morris__pratt_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.md5 b/de/d69/knuth__morris__pratt_8cpp__incl.md5
new file mode 100644
index 000000000..b91bff7b5
--- /dev/null
+++ b/de/d69/knuth__morris__pratt_8cpp__incl.md5
@@ -0,0 +1 @@
+af5ff9c29093781018fea3d9c9e792f5
\ No newline at end of file
diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.svg b/de/d69/knuth__morris__pratt_8cpp__incl.svg
new file mode 100644
index 000000000..1dc5dfb31
--- /dev/null
+++ b/de/d69/knuth__morris__pratt_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+strings/knuth_morris_pratt.cpp
+
+Node1
+
+strings/knuth_morris
+_pratt.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstring
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html
new file mode 100644
index 000000000..e4d80bc33
--- /dev/null
+++ b/de/d6a/knuth__morris__pratt_8cpp.html
@@ -0,0 +1,195 @@
+
+
+
+Algorithms_in_C++: strings/knuth_morris_pratt.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+More...
+
#include <iostream>#include <cstring>#include <vector>
+
+
The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+
+Preprocess pattern to identify any suffixes that are identical to prefixes. This tells us where to continue from if we get a mismatch between a character in our pattern and the text.
+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
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
77 std::string text =
"alskfjaldsabc1abc1abc12k23adsfabcabc" ;
+
+
+
80 if (
kmp (pattern, text) ==
true ) {
+
+
+
+
+
+
+
+
88 if (
kmp (pattern, text) ==
true ) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
bool kmp(const std::string &pattern, const std::string &text)
Definition: knuth_morris_pratt.cpp:56
+
diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..3bf0483d4
--- /dev/null
+++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+a62a4e1e546f55c30dfad1fe65cff63e
\ No newline at end of file
diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..7b4fe21ac
--- /dev/null
+++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,89 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+string_search::kmp
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+string_search::getFailure
+Array
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+std::string::size
+
+
+
+
+Node3->Node5
+
+
+
+Node4->Node5
+
+
+
diff --git a/de/d6c/palindrome__of__number_8cpp__incl.map b/de/d6c/palindrome__of__number_8cpp__incl.map
new file mode 100644
index 000000000..d7b2dea5c
--- /dev/null
+++ b/de/d6c/palindrome__of__number_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/de/d6c/palindrome__of__number_8cpp__incl.md5 b/de/d6c/palindrome__of__number_8cpp__incl.md5
new file mode 100644
index 000000000..c093429f6
--- /dev/null
+++ b/de/d6c/palindrome__of__number_8cpp__incl.md5
@@ -0,0 +1 @@
+10c4fbb5cba7eb12506f965c4a309c79
\ No newline at end of file
diff --git a/de/d6c/palindrome__of__number_8cpp__incl.svg b/de/d6c/palindrome__of__number_8cpp__incl.svg
new file mode 100644
index 000000000..164167458
--- /dev/null
+++ b/de/d6c/palindrome__of__number_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+others/palindrome_of_number.cpp
+
+Node1
+
+others/palindrome_of
+_number.cpp
+
+
+
+
+Node2
+
+algorithm
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cstring
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html
new file mode 100644
index 000000000..98b1281a7
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp.html
@@ -0,0 +1,485 @@
+
+
+
+Algorithms_in_C++: numerical_methods/qr_eigen_values.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.
+More...
+
#include <cassert>
+
#include <cmath>
+
#include <cstdlib>
+
#include <ctime>
+
#include <iostream>
+
#include "./qr_decompose.h "
+
+
+
Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.
+
Author Krishna Vedala
+
+
+
◆
+
+
+
+
limit of range of matrix values
+
+
+
+
+
+
◆
+
+
+
+
create a symmetric square matrix of given size with random elements. A symmetric square matrix will always have real eigen values.
+
Parameters
+
+ [out] A matrix to create (must be pre-allocated in memory)
+
+
+
+
29 int i, j, tmp, lim2 =
LIMS >> 1;
+
+
+
+
+
+
35 for (i = 0; i < N; i++) {
+
+
37 for (j = i + 1; j < N; j++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char **
+ argv
+
+ )
+
+
+
+
main function
+
+
+
+
246 mat_size =
atoi (argv[1]);
+
+
+
+
250 std::cout <<
"Usage: ./qr_eigen_values [mat_size]\n" ;
+
+
+
+
+
255 fprintf (stderr,
"Matrix size should be > 2\n" );
+
+
+
+
+
+
+
262 int i, rows = mat_size, columns = mat_size;
+
+
+
+
266 for (
int i = 0; i < rows; i++) {
+
+
+
+
+
+
+
+
+
275 clock_t t1 =
clock ();
+
+
277 double dtime =
static_cast< double > (
clock () - t1) / CLOCKS_PER_SEC;
+
+
+
280 for (i = 0; i < mat_size; i++)
std::cout << eigen_vals[i] <<
"\t" ;
+
281 std::cout <<
"\nTime taken to compute: " << dtime <<
" sec\n" ;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Perform multiplication of two matrices.
+R2 must be equal to C1
+Resultant matrix size should be R1xC2 Parameters
+
+ [in] A first matrix to multiply [in] B second matrix to multiply [out] OUT output matrix (must be pre-allocated)
+
+Returns pointer to resultant matrix
+
+
+
+
+
+
+
+
62 perror (
"Matrix dimensions mismatch!" );
+
+
+
+
66 for (
int i = 0; i < R1; i++) {
+
67 for (
int j = 0; j < C2; j++) {
+
+
69 for (
int k = 0;
k < C1;
k ++) {
+
70 OUT[0][i][j] += A[i][
k ] * B[
k ][j];
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test1
+ (
+ )
+
+
+
+
test function to compute eigen values of a 2x2 matrix
+\[\begin{bmatrix} 5 & 7\\ 7 & 11 \end{bmatrix}\]
+
+
which are approximately, {15.56158, 0.384227}
+
+
+
179 double y[] = {15.56158, 0.384227};
+
+
+
+
+
184 for (
int i = 0; i < 2; i++) {
+
185 std::cout << i + 1 <<
"/2 Checking for " << y[i] <<
" --> " ;
+
+
187 for (
int j = 0; j < 2 && !result; j++) {
+
188 if (std::abs(y[i] - eig_vals[j]) < 0.1) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void test2
+ (
+ )
+
+
+
+
test function to compute eigen values of a 2x2 matrix
+\[\begin{bmatrix} -4& 4& 2& 0& -3\\ 4& -4& 4& -3& -1\\ 2& 4& 4& 3& -3\\ 0& -3& 3& -1&-1\\ -3& -1& -3& -3& 0 \end{bmatrix}\]
+
+
which are approximately, {9.27648, -9.26948, 2.0181, -1.03516, -5.98994}
+
+
+
+
+
+
215 {-3, -1, -3, -3, 0}};
+
216 double y[] = {9.27648, -9.26948, 2.0181, -1.03516,
+
+
+
+
+
+
+
223 <<
"Eigen values: " << eig_vals <<
"\n" ;
+
+
225 for (
int i = 0; i < 5; i++) {
+
226 std::cout << i + 1 <<
"/5 Checking for " << y[i] <<
" --> " ;
+
+
228 for (
int j = 0; j < 5 && !result; j++) {
+
229 if (std::abs(y[i] - eig_vals[j]) < 0.1) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
void create_matrix(std::valarray< std::valarray< double >> *A)
Definition: qr_eigen_values.cpp:28
std::valarray< double > eigen_values(std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
Definition: qr_eigen_values.cpp:98
ll k
Definition: matrix_exponentiation.cpp:48
void test2()
Definition: qr_eigen_values.cpp:210
void test1()
Definition: qr_eigen_values.cpp:177
#define LIMS
Definition: qr_eigen_values.cpp:20
+
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
new file mode 100644
index 000000000..381038945
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
@@ -0,0 +1 @@
+7f6559a9bad74fb1bcc1eea038eaee5a
\ 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
new file mode 100644
index 000000000..7165a441b
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -0,0 +1,231 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node2
+
+
+
+Node9
+
+std::endl
+
+
+
+
+Node1->Node9
+
+
+
+Node3
+
+mat_mul
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+qr_algorithm::vector_mag
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+qr_algorithm::vector_proj
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_dot
+
+
+
+
+Node5->Node7
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
new file mode 100644
index 000000000..0ccfc0fee
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+test2
+
+Node1
+
+test2
+
+
+
+
+Node2
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node2
+
+
+
+Node9
+
+std::endl
+
+
+
+
+Node1->Node9
+
+
+
+Node3
+
+mat_mul
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+qr_algorithm::vector_mag
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+qr_algorithm::vector_proj
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_dot
+
+
+
+
+Node5->Node7
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
new file mode 100644
index 000000000..cf632f4df
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
@@ -0,0 +1,11 @@
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
new file mode 100644
index 000000000..7db3f7baa
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
@@ -0,0 +1 @@
+68524f9a1914d782e59fe01311c7bd91
\ 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
new file mode 100644
index 000000000..410cc22a7
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@@ -0,0 +1,231 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node2
+
+
+
+Node9
+
+std::endl
+
+
+
+
+Node1->Node9
+
+
+
+Node3
+
+mat_mul
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+qr_algorithm::vector_mag
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+qr_algorithm::vector_proj
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_dot
+
+
+
+
+Node5->Node7
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
new file mode 100644
index 000000000..5b2e400ee
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
@@ -0,0 +1,143 @@
+
+
+
+
+
+
+test1
+
+Node1
+
+test1
+
+
+
+
+Node2
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node2
+
+
+
+Node9
+
+std::endl
+
+
+
+
+Node1->Node9
+
+
+
+Node3
+
+mat_mul
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+qr_algorithm::vector_mag
+
+
+
+
+Node4->Node5
+
+
+
+Node8
+
+qr_algorithm::vector_proj
+
+
+
+
+Node4->Node8
+
+
+
+Node6
+
+std::sqrt
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_dot
+
+
+
+
+Node5->Node7
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map
new file mode 100644
index 000000000..ec7b7deba
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5
new file mode 100644
index 000000000..85baf6b21
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5
@@ -0,0 +1 @@
+bf6f7ec5ca04845009b2badc50fe5893
\ No newline at end of file
diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg
new file mode 100644
index 000000000..a0b547612
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+create_matrix
+
+Node1
+
+create_matrix
+
+
+
+
+Node2
+
+std::rand
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
new file mode 100644
index 000000000..5c70c6b75
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
@@ -0,0 +1,17 @@
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
new file mode 100644
index 000000000..39daccda6
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
@@ -0,0 +1 @@
+059a634ce09b1a75d5fc3b20aef7134a
\ 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
new file mode 100644
index 000000000..b98f2c17c
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@@ -0,0 +1,339 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+create_matrix
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node4
+
+
+
+Node11
+
+std::srand
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test1
+
+
+
+
+Node1->Node12
+
+
+
+Node14
+
+test2
+
+
+
+
+Node1->Node14
+
+
+
+Node15
+
+std::time
+
+
+
+
+Node1->Node15
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+mat_mul
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_mag
+
+
+
+
+Node6->Node7
+
+
+
+Node10
+
+qr_algorithm::vector_proj
+
+
+
+
+Node6->Node10
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+qr_algorithm::vector_dot
+
+
+
+
+Node7->Node9
+
+
+
+Node12->Node4
+
+
+
+Node13
+
+std::endl
+
+
+
+
+Node12->Node13
+
+
+
+Node14->Node4
+
+
+
+Node14->Node13
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
new file mode 100644
index 000000000..c8d515514
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
@@ -0,0 +1,251 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+create_matrix
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+qr_algorithm::eigen
+_values
+
+
+
+
+Node1->Node4
+
+
+
+Node11
+
+std::srand
+
+
+
+
+Node1->Node11
+
+
+
+Node12
+
+test1
+
+
+
+
+Node1->Node12
+
+
+
+Node14
+
+test2
+
+
+
+
+Node1->Node14
+
+
+
+Node15
+
+std::time
+
+
+
+
+Node1->Node15
+
+
+
+Node3
+
+std::rand
+
+
+
+
+Node2->Node3
+
+
+
+Node5
+
+mat_mul
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+qr_algorithm::qr_decompose
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+qr_algorithm::vector_mag
+
+
+
+
+Node6->Node7
+
+
+
+Node10
+
+qr_algorithm::vector_proj
+
+
+
+
+Node6->Node10
+
+
+
+Node8
+
+std::sqrt
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+qr_algorithm::vector_dot
+
+
+
+
+Node7->Node9
+
+
+
+Node12->Node4
+
+
+
+Node13
+
+std::endl
+
+
+
+
+Node12->Node13
+
+
+
+Node14->Node4
+
+
+
+Node14->Node13
+
+
+
diff --git a/de/d7c/struct_trie_1_1_trie_node-members.html b/de/d7c/struct_trie_1_1_trie_node-members.html
new file mode 100644
index 000000000..4a06f727c
--- /dev/null
+++ b/de/d7c/struct_trie_1_1_trie_node-members.html
@@ -0,0 +1,113 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Trie::TrieNode , including all inherited members.
+
+
Algorithms_in_C++: others/decimal_to_roman_numeral.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.
+More...
+
#include <cmath>#include <cstdio>#include <cstring>#include <iostream>
+
+
This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.
+
+
+
◆
+
+
+
+
+
+ std::string fill (
+ char
+ c ,
+
+ int
+ n
+
+ )
+
+
+
+
This functions fills a string with character c, n times and returns it
Note This can probably be replace by memcpy function.
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
+
92 std::cout <<
"\t\tRoman numbers converter\n\n" ;
+
93 std::cout <<
"Type in decimal number between 0 up to 4000 (exclusive): " ;
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
to convert to lowercase Roman Numeral the function works recursively
+
+
+
+
+
28 return fill (
'i' , 5 - n) +
"v" ;
+
+
+
+
32 return fill (
'i' , 10 - n) +
"x" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
to convert to uppercase Roman Numeral the function works recursively
+
+
+
+
+
62 return fill (
'I' , 5 - n) +
"V" ;
+
+
+
+
66 return fill (
'I' , 10 - n) +
"X" ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
std::string tolowerRoman(int n)
Definition: decimal_to_roman_numeral.cpp:24
std::string fill(char c, int n)
Definition: decimal_to_roman_numeral.cpp:15
std::string toupperRoman(int n)
Definition: decimal_to_roman_numeral.cpp:58
+
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5
new file mode 100644
index 000000000..597e57075
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5
@@ -0,0 +1 @@
+f710e2d8b6cc6f50984992fe66292e0b
\ 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
new file mode 100644
index 000000000..76aa49816
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+tolowerRoman
+
+Node1
+
+tolowerRoman
+
+
+
+
+Node2
+
+fill
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map
new file mode 100644
index 000000000..3f382190e
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5
new file mode 100644
index 000000000..bc99c4e0a
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5
@@ -0,0 +1 @@
+728539a9650eb359a199ea70c18650c0
\ 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
new file mode 100644
index 000000000..7abc1b0bf
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+toupperRoman
+
+Node1
+
+toupperRoman
+
+
+
+
+Node2
+
+fill
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..9383fec90
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..99d418038
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+c8cd6b7042ff5ebfdf1b6db8235899a6
\ 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
new file mode 100644
index 000000000..3f091ccae
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,73 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tolowerRoman
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+toupperRoman
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+fill
+
+
+
+
+Node2->Node3
+
+
+
+Node4->Node3
+
+
+
diff --git a/de/d8a/class_trie-members.html b/de/d8a/class_trie-members.html
new file mode 100644
index 000000000..bd11dcdfa
--- /dev/null
+++ b/de/d8a/class_trie-members.html
@@ -0,0 +1,119 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Trie , including all inherited members.
+
+ ALPHABETS (defined in Trie )Trie private static hasChildren (std::shared_ptr< TrieNode > node)Trie inline private static insert (const std::string &word)Trie inline m_root (defined in Trie )Trie private removeWord (const std::string &word) (defined in Trie )Trie inline removeWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)Trie inline private search (const std::string &word)Trie inline Trie ()Trie inline
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Queue_Array , including all inherited members.
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for list , including all inherited members.
+
+
Algorithms_in_C++: math/prime_numbers.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Get list of prime numbers.
+More...
+
#include <iostream>#include <vector>
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
+
27 std::cout <<
"Calculate primes up to:\n>> " ;
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
Generate an increasingly large number of primes and store in a list
+
+
+
+
+
16 for (
int i = 2; i <
max ; i++) {
+
+
18 for (
int j = i; j <
max ; j += i) numbers[j] =
true ;
+
+
+
+
+
+
+
+
+
+
+
+
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5
new file mode 100644
index 000000000..42fed2534
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5
@@ -0,0 +1 @@
+c724d045227b4ab296082cfac7279b55
\ No newline at end of file
diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg
new file mode 100644
index 000000000..9bef758b2
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+primes
+
+Node1
+
+primes
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..e6f19c046
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,7 @@
+
+
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..583fcc32e
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+8e89adb06e5c7748c8b9a8f506f2a57b
\ 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
new file mode 100644
index 000000000..a55c09ab0
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+ans
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+primes
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+std::vector::push_back
+
+
+
+
+Node4->Node5
+
+
+
diff --git a/de/db2/quick__sort_8cpp__incl.map b/de/db2/quick__sort_8cpp__incl.map
new file mode 100644
index 000000000..8091649d0
--- /dev/null
+++ b/de/db2/quick__sort_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/de/db2/quick__sort_8cpp__incl.md5 b/de/db2/quick__sort_8cpp__incl.md5
new file mode 100644
index 000000000..6f2dc525a
--- /dev/null
+++ b/de/db2/quick__sort_8cpp__incl.md5
@@ -0,0 +1 @@
+4b46081768df50ee71c6abb048fa8066
\ No newline at end of file
diff --git a/de/db2/quick__sort_8cpp__incl.svg b/de/db2/quick__sort_8cpp__incl.svg
new file mode 100644
index 000000000..28ffb6b28
--- /dev/null
+++ b/de/db2/quick__sort_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+sorting/quick_sort.cpp
+
+Node1
+
+sorting/quick_sort.cpp
+
+
+
+
+Node2
+
+cstdlib
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/de/db5/class_edge-members.html b/de/db5/class_edge-members.html
new file mode 100644
index 000000000..b0429499d
--- /dev/null
+++ b/de/db5/class_edge-members.html
@@ -0,0 +1,123 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for Edge , including all inherited members.
+
+ dest (defined in Edge )Edge dst (defined in Edge )Edge Edge ()=delete (defined in Edge )Edge Edge (Edge &&)=default (defined in Edge )Edge Edge (Edge const &)=default (defined in Edge )Edge Edge (unsigned int source, unsigned int destination)Edge inline operator= (Edge &&)=default (defined in Edge )Edge operator= (Edge const &)=default (defined in Edge )Edge src (defined in Edge )Edge src (defined in Edge )Edge weight (defined in Edge )Edge ~Edge ()=default (defined in Edge )Edge
+
Algorithms_in_C++: data_structures/binaryheap.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A C++ program to demonstrate common Binary Heap Operations.
+More...
+
#include <climits>#include <iostream>#include <utility>
+
+
A C++ program to demonstrate common Binary Heap Operations.
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for large_number , including all inherited members.
+
+
Algorithms_in_C++: math/binary_exponent.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
C++ Program to find Binary Exponent Iteratively and Recursively.
+More...
+
#include <iostream>
+
+
C++ Program to find Binary Exponent Iteratively and Recursively.
+
Calculate \(a^b\) in \(O(\log(b))\) by converting \(b\) to a binary number. Binary exponentiation is also known as exponentiation by squaring.
Note This is a far better approach compared to naive method which provide \(O(b)\) operations.
+
Example: 10 in base 2 is 1010.
+\begin{eqnarray*} 2^{10_d} &=& 2^{1010_b} = 2^8 * 2^2\\ 2^1 &=& 2\\ 2^2 &=& (2^1)^2 = 2^2 = 4\\ 2^4 &=& (2^2)^2 = 4^2 = 16\\ 2^8 &=& (2^4)^2 = 16^2 = 256\\ \end{eqnarray*}
+
+
Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\).
+
+
+
◆
+
+
+
+
+
+ int binExpo
+ (
+ int
+ a ,
+
+ int
+ b
+
+ )
+
+
+
+
Recursive function to calculate exponent in \(O(\log(n))\) using binary exponent.
+
+
+
+
+
◆
+
+
+
+
+
+ int binExpo_alt
+ (
+ int
+ a ,
+
+ int
+ b
+
+ )
+
+
+
+
Iterative function to calculate exponent in \(O(\log(n))\) using binary exponent.
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
+
Main function.
+
Give two numbers a, b
+
int resIterate = binExpo_alt(a, b);
+
Result of a^b (where '^' denotes exponentiation)
+
std::cout << resIterate << std::endl ;
+
+
+
+
+
59 if (
a == 0 && b == 0) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int binExpo(int a, int b)
Definition: binary_exponent.cpp:28
vector< ll > a
Definition: matrix_exponentiation.cpp:53
Algorithms_in_C++: numerical_methods/newton_raphson_method.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.
+More...
+
#include <cmath>#include <ctime>#include <iostream>#include <limits>
+EPSILON 1e-6 MAX_ITERATIONS 50000 Maximum number of iterations to check.
+static double eq (double i) static double eq_der (double i) int main ()
+
+
Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.
+
The \((i+1)^\text{th}\) approximation is given by:
+\[ x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i)} \]
+
+
Author Krishna Vedala
+
See also bisection_method.cpp , false_position.cpp
+
+
+
◆
+
+
+
+
+
+
+
+
+ static double eq
+ (
+ double
+ i )
+
+
+
+
+static
+
+
+
+
define \(f(x)\) to find root for
+
+
27 return (
std::pow (i, 3) - (4 * i) - 9);
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static double eq_der
+ (
+ double
+ i )
+
+
+
+
+static
+
+
+
+
define the derivative function \(f'(x)\)
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
43 std::cout <<
"\nInitial approximation: " << c;
+
+
+
+
+
+
+
+
+
+
53 if (std::abs(m) < EPSILON)
+
+
+
+
+
+
+
+
+
+
+
+
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: newton_raphson_method.cpp:22
static double eq(double i)
Definition: newton_raphson_method.cpp:26
static double eq_der(double i)
Definition: newton_raphson_method.cpp:32
+
diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
new file mode 100644
index 000000000..ecfa65278
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
@@ -0,0 +1 @@
+ebb04cd15e67d7a7b151a478105c7fad
\ 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
new file mode 100644
index 000000000..c3eea1476
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+eq
+
+Node1
+
+eq
+
+
+
+
+Node2
+
+std::pow
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map
new file mode 100644
index 000000000..dcab8cffc
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5
new file mode 100644
index 000000000..c996d6b43
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5
@@ -0,0 +1 @@
+c83bd1d152d8b23784fc627b77621f50
\ 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
new file mode 100644
index 000000000..2e9619de8
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+eq_der
+
+Node1
+
+eq_der
+
+
+
+
+Node2
+
+std::pow
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..6237da0b6
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..054e93adb
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+d5eb5c4ea1e41ebc82aec90ab0eaa2a4
\ 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
new file mode 100644
index 000000000..5275e3f7f
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::srand
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::time
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/de/de4/fibonacci__large_8cpp.html b/de/de4/fibonacci__large_8cpp.html
new file mode 100644
index 000000000..020750b15
--- /dev/null
+++ b/de/de4/fibonacci__large_8cpp.html
@@ -0,0 +1,175 @@
+
+
+
+Algorithms_in_C++: math/fibonacci_large.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.
+More...
+
#include <cinttypes>
+
#include <ctime>
+
#include <iostream>
+
#include "./large_number.h "
+
+large_number fib (uint64_t n) main (int argc, char *argv[])
+
+
Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.
+
Took 0.608246 seconds to compute 50,000^th Fibonacci number that contains 10450 digits!
+
Author Krishna Vedala
+
See also fibonacci.cpp , fibonacci_fast.cpp , string_fibonacci.cpp
+
+
+
◆
+
+
+
+
Compute fibonacci numbers using the relation
+\[f(n)=f(n-1)+f(n-2)\]
+
+
and returns the result as a large_number type.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Definition: large_number.h:24
Algorithms_in_C++: others/decimal_to_binary.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Function to convert decimal number to binary representation.
+More...
+
#include <iostream>
+void method1 (int number) void method2 (int number) main ()
+
+
Function to convert decimal number to binary representation.
+
+
+
◆
+
+
+
+
+
+ void method1
+ (
+ int
+ number )
+
+
+
+
This method converts the bit representation and stores it as a decimal number.
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void method2
+ (
+ int
+ number )
+
+
+
+
This method stores each bit value from LSB to MSB and then prints them back from MSB to LSB
+
+
+
+
+
+
32 bool bit = number & 0x01;
+
+
34 bit_string[num_bits++] =
'1' ;
+
+
36 bit_string[num_bits++] =
'0' ;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5
new file mode 100644
index 000000000..eea2960bd
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5
@@ -0,0 +1 @@
+3c4e8f992ea59f183dfecf1f41b20539
\ 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
new file mode 100644
index 000000000..146c03922
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+method2
+
+Node1
+
+method2
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map
new file mode 100644
index 000000000..2e38e9a6e
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5
new file mode 100644
index 000000000..756989b2a
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5
@@ -0,0 +1 @@
+888f430fa2a3ccc0a3f97ff78c3aab71
\ 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
new file mode 100644
index 000000000..a5808885e
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+method1
+
+Node1
+
+method1
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/df/d0f/fibonacci_8cpp__incl.map b/df/d0f/fibonacci_8cpp__incl.map
new file mode 100644
index 000000000..c6569c877
--- /dev/null
+++ b/df/d0f/fibonacci_8cpp__incl.map
@@ -0,0 +1,5 @@
+
+
diff --git a/df/d0f/fibonacci_8cpp__incl.md5 b/df/d0f/fibonacci_8cpp__incl.md5
new file mode 100644
index 000000000..2e71bcfb4
--- /dev/null
+++ b/df/d0f/fibonacci_8cpp__incl.md5
@@ -0,0 +1 @@
+aead6fed1017e9b63f0374840d524e12
\ No newline at end of file
diff --git a/df/d0f/fibonacci_8cpp__incl.svg b/df/d0f/fibonacci_8cpp__incl.svg
new file mode 100644
index 000000000..0bb6575a5
--- /dev/null
+++ b/df/d0f/fibonacci_8cpp__incl.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+math/fibonacci.cpp
+
+Node1
+
+math/fibonacci.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/df/d27/class_bit.html b/df/d27/class_bit.html
new file mode 100644
index 000000000..f22b5e253
--- /dev/null
+++ b/df/d27/class_bit.html
@@ -0,0 +1,157 @@
+
+
+
+Algorithms_in_C++: Bit Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Bit (vector < int > &arr) Bit (int x) update (int id, int val) sum (int id) sum_range (int l, int r)
+offset (int x)
+n vector < int > bit
+
The documentation for this class was generated from the following file:
+
+
Algorithms_in_C++: search/interpolation_search2.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Interpolation search algorithm
+More...
+
#include <iostream>
+
+
+
+
◆
+
+
+
+
+
+ int InterpolationSearch
+ (
+ int
+ A [],
+
+ int
+ n ,
+
+ int
+ x
+
+ )
+
+
+
+
function to search the value in an array using interpolation search
Parameters
+
+ [in] arr array to search in [in] value value to search for [in] len length of array
+
+
+
Returns index where the value is found
+
+-1 if not found
+
+
+
+
+
19 int mid = low + (((high - 1) * (x - A[low])) / (A[high] - A[low]));
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
main function
+
< passed array A inside the InterpolationSearch function
+
+
33 int A[] = {2, 4, 5, 7, 13, 14, 15, 23};
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int InterpolationSearch(int A[], int n, int x)
Definition: interpolation_search2.cpp:15
+
diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..97f771200
--- /dev/null
+++ b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+ee05305faa520af3901c305bf62887b7
\ 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
new file mode 100644
index 000000000..c35d6be5b
--- /dev/null
+++ b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+InterpolationSearch
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/df/d3c/exponential__search_8cpp__incl.map b/df/d3c/exponential__search_8cpp__incl.map
new file mode 100644
index 000000000..d092674a8
--- /dev/null
+++ b/df/d3c/exponential__search_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/df/d3c/exponential__search_8cpp__incl.md5 b/df/d3c/exponential__search_8cpp__incl.md5
new file mode 100644
index 000000000..fc983c7a7
--- /dev/null
+++ b/df/d3c/exponential__search_8cpp__incl.md5
@@ -0,0 +1 @@
+433c55cf298e9cf95854d26e1ee9632e
\ No newline at end of file
diff --git a/df/d3c/exponential__search_8cpp__incl.svg b/df/d3c/exponential__search_8cpp__incl.svg
new file mode 100644
index 000000000..6b7ca4ca6
--- /dev/null
+++ b/df/d3c/exponential__search_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+search/exponential_search.cpp
+
+Node1
+
+search/exponential
+_search.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstring
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/df/d86/rabin__karp_8cpp__incl.map b/df/d86/rabin__karp_8cpp__incl.map
new file mode 100644
index 000000000..7f6224c23
--- /dev/null
+++ b/df/d86/rabin__karp_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
diff --git a/df/d86/rabin__karp_8cpp__incl.md5 b/df/d86/rabin__karp_8cpp__incl.md5
new file mode 100644
index 000000000..1926c18a4
--- /dev/null
+++ b/df/d86/rabin__karp_8cpp__incl.md5
@@ -0,0 +1 @@
+1c6300b160a0a1f5d5fa8acdf5239669
\ No newline at end of file
diff --git a/df/d86/rabin__karp_8cpp__incl.svg b/df/d86/rabin__karp_8cpp__incl.svg
new file mode 100644
index 000000000..d5ab55ade
--- /dev/null
+++ b/df/d86/rabin__karp_8cpp__incl.svg
@@ -0,0 +1,82 @@
+
+
+
+
+
+
+strings/rabin_karp.cpp
+
+Node1
+
+strings/rabin_karp.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cmath
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+cstring
+
+
+
+
+Node1->Node5
+
+
+
diff --git a/df/dc8/successive__approximation_8cpp.html b/df/dc8/successive__approximation_8cpp.html
new file mode 100644
index 000000000..b9cf50ba8
--- /dev/null
+++ b/df/dc8/successive__approximation_8cpp.html
@@ -0,0 +1,246 @@
+
+
+
+Algorithms_in_C++: numerical_methods/successive_approximation.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Method of successive approximations using fixed-point iteration method.
+More...
+
#include <cmath>#include <iostream>
+static float eq (float y) static float eqd (float y) int main ()
+
+
Method of successive approximations using fixed-point iteration method.
+
+
+
◆
+
+
+
+
+
+
+
+
+ static float eq
+ (
+ float
+ y )
+
+
+
+
+static
+
+
+
+
equation 1
+\[f(y) = 3y - \cos y -2\]
+
+
12 {
return (3 * y) -
cos (y) - 2; }
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static float eqd
+ (
+ float
+ y )
+
+
+
+
+static
+
+
+
+
equation 2
+\[f(y) = \frac{\cos y+2}{2}\]
+
+
17 {
return 0.5 * (
cos (y) + 2); }
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
21 float y, x1, x2, x3, sum, s,
a , f1, f2, gd;
+
+
+
24 for (i = 0; i < 10; i++) {
+
+
26 std::cout <<
"value of equation at " << i <<
" " << sum <<
"\n" ;
+
+
+
+
+
31 std::cout <<
"enter the no iteration to perform->\n" ;
+
+
+
34 for (i = 0; i <= n; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
static float eqd(float y)
Definition: successive_approximation.cpp:17
static float eq(float y)
Definition: successive_approximation.cpp:12
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..e54cdbc1d
--- /dev/null
+++ b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+102ab08fa39138d36326dbf570699389
\ 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
new file mode 100644
index 000000000..8c6ef6fa5
--- /dev/null
+++ b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+eq
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+eqd
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/df/dd4/stairs__pattern_8cpp__incl.map b/df/dd4/stairs__pattern_8cpp__incl.map
new file mode 100644
index 000000000..3ca4b1bf4
--- /dev/null
+++ b/df/dd4/stairs__pattern_8cpp__incl.map
@@ -0,0 +1,4 @@
+
+
diff --git a/df/dd4/stairs__pattern_8cpp__incl.md5 b/df/dd4/stairs__pattern_8cpp__incl.md5
new file mode 100644
index 000000000..a4b52e183
--- /dev/null
+++ b/df/dd4/stairs__pattern_8cpp__incl.md5
@@ -0,0 +1 @@
+405d5e7494690bc8e281593bd63860b1
\ No newline at end of file
diff --git a/df/dd4/stairs__pattern_8cpp__incl.svg b/df/dd4/stairs__pattern_8cpp__incl.svg
new file mode 100644
index 000000000..0437ced31
--- /dev/null
+++ b/df/dd4/stairs__pattern_8cpp__incl.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+others/stairs_pattern.cpp
+
+Node1
+
+others/stairs_pattern.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/df/dd5/binary__search_8cpp.html b/df/dd5/binary__search_8cpp.html
new file mode 100644
index 000000000..13d1a8ba2
--- /dev/null
+++ b/df/dd5/binary__search_8cpp.html
@@ -0,0 +1,257 @@
+
+
+
+Algorithms_in_C++: search/binary_search.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Binary search algorithm
+More...
+
#include <iostream>
+int binary_search (int a [], int r, int key) int main (int argc, char const *argv[])
+
+
+
+
◆
+
+
+
+
+
+ int binary_search
+ (
+ int
+ a [],
+
+ int
+ r ,
+
+ int
+ key
+
+ )
+
+
+
+
binary_search function
Parameters
+
+ [in] a array to sort [in] r right hand limit = \(n-1\) [in] key value to find
+
+
+
Returns index if T is found
+
+-1 if T is not found
+
+
+
+
+
19 int m = l + (r - l) / 2;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ int
+ argc ,
+
+ char const *
+ argv []
+
+ )
+
+
+
+
main function
+
+
+
+
+
+
+
+
+
+
40 for (
int i = 0; i < n; i++) {
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
int binary_search(int a[], int r, int key)
Definition: binary_search.cpp:15
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
diff --git a/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
new file mode 100644
index 000000000..d5a63e829
--- /dev/null
+++ b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
@@ -0,0 +1 @@
+9acab01bae3e42b3a24ada6558bec4f3
\ No newline at end of file
diff --git a/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
new file mode 100644
index 000000000..fa9f41259
--- /dev/null
+++ b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+binary_search
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node1->Node3
+
+
+
diff --git a/df/dd7/structlinkedlist-members.html b/df/dd7/structlinkedlist-members.html
new file mode 100644
index 000000000..f1b23b75d
--- /dev/null
+++ b/df/dd7/structlinkedlist-members.html
@@ -0,0 +1,113 @@
+
+
+
+Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for linkedlist , including all inherited members.
+
+
+
diff --git a/df/ddc/struct_node__coll__graph.md5 b/df/ddc/struct_node__coll__graph.md5
new file mode 100644
index 000000000..af23d5d0c
--- /dev/null
+++ b/df/ddc/struct_node__coll__graph.md5
@@ -0,0 +1 @@
+6d52568ff645f92b7b7485c4f03983fb
\ No newline at end of file
diff --git a/df/ddc/struct_node__coll__graph.svg b/df/ddc/struct_node__coll__graph.svg
new file mode 100644
index 000000000..4dc85a45f
--- /dev/null
+++ b/df/ddc/struct_node__coll__graph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+Node
+
+Node1
+
+Node
+
+
+
+
+Node1->Node1
+ next
+
+
+
diff --git a/df/def/power__for__huge__numbers_8cpp.html b/df/def/power__for__huge__numbers_8cpp.html
new file mode 100644
index 000000000..19e0752be
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp.html
@@ -0,0 +1,327 @@
+
+
+
+Algorithms_in_C++: math/power_for_huge_numbers.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Compute powers of large numbers.
+More...
+
#include <iostream>
+#define MAX 100000
+int multiply (int x, int res[], int res_size) void power (int x, int n) int main ()
+
+
Compute powers of large numbers.
+
+
+
◆
+
+
+
+
+
+ #define MAX 100000
+
+
+
+
Maximum number of digits in output \(x^n\) where \(1 <= x,\; n <= 10000\) and overflow may happen
+
+
+
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ )
+
+
+
+
Main function
+
+
+
+
+
+
+
88 power (base, exponent);
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int multiply
+ (
+ int
+ x ,
+
+ int
+ res [],
+
+ int
+ res_size
+
+ )
+
+
+
+
This function multiplies x with the number represented by res[]. res_size is size of res[] or number of digits in the number represented by res[]. This function uses simple school mathematics for multiplication. This function may value of res_size and returns the new value of res_size
Parameters
+
+ x multiplicand res large number representation using array res_size number of digits in res
+
+
+
+
+
+
+
+
+
31 for (
int i = 0; i < res_size; i++) {
+
32 int prod = res[i] * x + carry;
+
+
+
+
+
+
+
+
+
+
+
+
+
45 res[res_size] = carry % 10;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void power
+ (
+ int
+ x ,
+
+ int
+ n
+
+ )
+
+
+
+
This function finds power of a number x and print \(x^n\)
Parameters
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
69 res[res_size++] = temp % 10;
+
+
+
+
+
+
75 for (
int i = 2; i <= n; i++) res_size =
multiply (x, res, res_size);
+
+
+
78 for (
int i = res_size - 1; i >= 0; i--)
std::cout << res[i];
+
+
+
+
+
+
+
+
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
#define MAX
Definition: power_for_huge_numbers.cpp:10
+
diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5
new file mode 100644
index 000000000..434461bea
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5
@@ -0,0 +1 @@
+3df9151c06eddefd14e3d2ded32ac1dc
\ 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
new file mode 100644
index 000000000..b57054db4
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+power
+
+Node1
+
+power
+
+
+
+
+Node2
+
+multiply
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..084737ff6
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..605326aa9
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+dd50750aecb0f8138266b6e1aebb276d
\ 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
new file mode 100644
index 000000000..6afb0c4d8
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+power
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+multiply
+
+
+
+
+Node2->Node3
+
+
+
diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html
new file mode 100644
index 000000000..da4750ba5
--- /dev/null
+++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html
@@ -0,0 +1,109 @@
+
+
+
+Algorithms_in_C++: range_queries Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: greedy_algorithms Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: graph Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: search Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: math Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: data_structures Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: machine_learning Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: operations_on_datastructures Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: strings Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: probability Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: dynamic_programming Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: others Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: numerical_methods Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: sorting Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: backtracking Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: geometry Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: hashing Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: data_structures/cll Directory Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Algorithms_in_C++: File List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented files with brief descriptions:
+
+
Algorithms_in_C++: Class Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented class members with links to the class documentation for each member:
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: Class Members - Functions
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+hasChildren()
+: Trie
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: Class Members - Related Functions
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: Class Members - Variables
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main()
+: avltree.cpp
+, linkedlist_implentation_usingarray.cpp
+, line_segment_intersection.cpp
+, binary_exponent.cpp
+, fibonacci_fast.cpp
+, bisection_method.cpp
+, exponential_search.cpp
+, hash_search.cpp
+, false_position.cpp
+, interpolation_search.cpp
+, rabin_karp.cpp
+, knuth_morris_pratt.cpp
+, brute_force_string_searching.cpp
+, shell_sort2.cpp
+, quick_sort.cpp
+, text_search.cpp
+, ternary_search.cpp
+, interpolation_search2.cpp
+, gcd_iterative_euclidean.cpp
+, gaussian_elimination.cpp
+, linear_search.cpp
+, median_search.cpp
+, lu_decompose.cpp
+, binary_search.cpp
+, poisson_dist.cpp
+, binomial_dist.cpp
+, bayes_theorem.cpp
+, addition_rule.cpp
+, vector_important_functions.cpp
+, tower_of_hanoi.cpp
+, stairs_pattern.cpp
+, spiral_print.cpp
+, sparse_matrix.cpp
+, smallest_circle.cpp
+, primality_test.cpp
+, pascal_triangle.cpp
+, palindrome_of_number.cpp
+, matrix_exponentiation.cpp
+, happy_number.cpp
+, fast_interger_input.cpp
+, decimal_to_roman_numeral.cpp
+, decimal_to_hexadecimal.cpp
+, buzz_number.cpp
+, successive_approximation.cpp
+, qr_eigen_values.cpp
+, qr_decomposition.cpp
+, ordinary_least_squares_regressor.cpp
+, ode_semi_implicit_euler.cpp
+, ode_midpoint_euler.cpp
+, check_prime.cpp
+, gcd_of_n_numbers.cpp
+, newton_raphson_method.cpp
+, ode_forward_euler.cpp
+, gcd_recursive_euclidean.cpp
+, adaline_learning.cpp
+, string_fibonacci.cpp
+, sqrt_double.cpp
+, sieve_of_eratosthenes.cpp
+, realtime_stats.cpp
+, primes_up_to_billion.cpp
+, prime_numbers.cpp
+, prime_factorization.cpp
+, power_for_huge_numbers.cpp
+, number_of_positive_divisors.cpp
+, modular_inverse_fermat_little_theorem.cpp
+, double_factorial.cpp
+, large_factorial.cpp
+, least_common_multiple.cpp
+, eulers_totient_function.cpp
+, trie_modern.cpp
+, kohonen_som_topology.cpp
+, fibonacci.cpp
+, fast_power.cpp
+, extended_euclid_algorithm.cpp
+, factorial.cpp
+, kohonen_som_trace.cpp
+
+mat_mul()
+: qr_eigen_values.cpp
+
+method1()
+: decimal_to_binary.cpp
+
+method2()
+: decimal_to_binary.cpp
+
+midpoint_euler()
+: ode_midpoint_euler.cpp
+
+midpoint_euler_step()
+: ode_midpoint_euler.cpp
+
+minValue()
+: avltree.cpp
+
+mov()
+: tower_of_hanoi.cpp
+
+multiply()
+: matrix_exponentiation.cpp
+, power_for_huge_numbers.cpp
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ternary_search()
+: ternary_search.cpp
+
+test()
+: smallest_circle.cpp
+
+test1()
+: kohonen_som_topology.cpp
+, qr_eigen_values.cpp
+, kohonen_som_trace.cpp
+, adaline_learning.cpp
+, large_factorial.cpp
+, durand_kerner_roots.cpp
+
+test2()
+: adaline_learning.cpp
+, kohonen_som_topology.cpp
+, kohonen_som_trace.cpp
+, large_factorial.cpp
+, durand_kerner_roots.cpp
+, qr_eigen_values.cpp
+, smallest_circle.cpp
+
+test3()
+: smallest_circle.cpp
+, adaline_learning.cpp
+, kohonen_som_topology.cpp
+, kohonen_som_trace.cpp
+
+test_2d_classes()
+: kohonen_som_topology.cpp
+
+test_3d_classes()
+: kohonen_som_trace.cpp
+
+test_3d_classes1()
+: kohonen_som_topology.cpp
+
+test_3d_classes2()
+: kohonen_som_topology.cpp
+
+test_circle()
+: kohonen_som_trace.cpp
+
+test_f()
+: shell_sort2.cpp
+
+test_function()
+: realtime_stats.cpp
+
+test_int()
+: shell_sort2.cpp
+
+test_lamniscate()
+: kohonen_som_trace.cpp
+
+tests()
+: least_common_multiple.cpp
+
+TH()
+: tower_of_hanoi.cpp
+
+tolowerRoman()
+: decimal_to_roman_numeral.cpp
+
+toupperRoman()
+: decimal_to_roman_numeral.cpp
+
+TriangleArea()
+: smallest_circle.cpp
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+main()
+: avltree.cpp
+, linkedlist_implentation_usingarray.cpp
+, line_segment_intersection.cpp
+, binary_exponent.cpp
+, fibonacci_fast.cpp
+, bisection_method.cpp
+, exponential_search.cpp
+, hash_search.cpp
+, false_position.cpp
+, interpolation_search.cpp
+, interpolation_search2.cpp
+, gcd_iterative_euclidean.cpp
+, gaussian_elimination.cpp
+, linear_search.cpp
+, median_search.cpp
+, lu_decompose.cpp
+, ternary_search.cpp
+, text_search.cpp
+, check_prime.cpp
+, gcd_of_n_numbers.cpp
+, newton_raphson_method.cpp
+, rabin_karp.cpp
+, quick_sort.cpp
+, shell_sort2.cpp
+, ode_forward_euler.cpp
+, brute_force_string_searching.cpp
+, knuth_morris_pratt.cpp
+, gcd_recursive_euclidean.cpp
+, ode_midpoint_euler.cpp
+, ode_semi_implicit_euler.cpp
+, adaline_learning.cpp
+, double_factorial.cpp
+, large_factorial.cpp
+, ordinary_least_squares_regressor.cpp
+, binary_search.cpp
+, poisson_dist.cpp
+, binomial_dist.cpp
+, bayes_theorem.cpp
+, addition_rule.cpp
+, vector_important_functions.cpp
+, tower_of_hanoi.cpp
+, stairs_pattern.cpp
+, spiral_print.cpp
+, sparse_matrix.cpp
+, smallest_circle.cpp
+, primality_test.cpp
+, pascal_triangle.cpp
+, palindrome_of_number.cpp
+, matrix_exponentiation.cpp
+, happy_number.cpp
+, fast_interger_input.cpp
+, decimal_to_roman_numeral.cpp
+, decimal_to_hexadecimal.cpp
+, buzz_number.cpp
+, qr_decomposition.cpp
+, least_common_multiple.cpp
+, qr_eigen_values.cpp
+, successive_approximation.cpp
+, eulers_totient_function.cpp
+, modular_inverse_fermat_little_theorem.cpp
+, number_of_positive_divisors.cpp
+, trie_modern.cpp
+, kohonen_som_topology.cpp
+, extended_euclid_algorithm.cpp
+, power_for_huge_numbers.cpp
+, prime_factorization.cpp
+, string_fibonacci.cpp
+, sqrt_double.cpp
+, sieve_of_eratosthenes.cpp
+, realtime_stats.cpp
+, factorial.cpp
+, prime_numbers.cpp
+, primes_up_to_billion.cpp
+, kohonen_som_trace.cpp
+, fast_power.cpp
+, fibonacci.cpp
+
+mat_mul()
+: qr_eigen_values.cpp
+
+MAX
+: ternary_search.cpp
+, paranthesis_matching.cpp
+, fibonacci_fast.cpp
+, sieve_of_eratosthenes.cpp
+, power_for_huge_numbers.cpp
+, hash_search.cpp
+
+MAX_ITERATIONS
+: bisection_method.cpp
+, false_position.cpp
+, newton_raphson_method.cpp
+
+MAX_NUM
+: median_search.cpp
+
+method1()
+: decimal_to_binary.cpp
+
+method2()
+: decimal_to_binary.cpp
+
+midpoint_euler()
+: ode_midpoint_euler.cpp
+
+midpoint_euler_step()
+: ode_midpoint_euler.cpp
+
+MIN_DISTANCE
+: kohonen_som_topology.cpp
+
+minValue()
+: avltree.cpp
+
+mov()
+: tower_of_hanoi.cpp
+
+multiply()
+: power_for_huge_numbers.cpp
+, matrix_exponentiation.cpp
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+ternary_search()
+: ternary_search.cpp
+
+test()
+: smallest_circle.cpp
+
+test1()
+: kohonen_som_topology.cpp
+, qr_eigen_values.cpp
+, kohonen_som_trace.cpp
+, adaline_learning.cpp
+, large_factorial.cpp
+, durand_kerner_roots.cpp
+
+test2()
+: adaline_learning.cpp
+, kohonen_som_topology.cpp
+, kohonen_som_trace.cpp
+, large_factorial.cpp
+, durand_kerner_roots.cpp
+, qr_eigen_values.cpp
+, smallest_circle.cpp
+
+test3()
+: adaline_learning.cpp
+, kohonen_som_topology.cpp
+, kohonen_som_trace.cpp
+, smallest_circle.cpp
+
+test_2d_classes()
+: kohonen_som_topology.cpp
+
+test_3d_classes()
+: kohonen_som_trace.cpp
+
+test_3d_classes1()
+: kohonen_som_topology.cpp
+
+test_3d_classes2()
+: kohonen_som_topology.cpp
+
+test_circle()
+: kohonen_som_trace.cpp
+
+test_f()
+: shell_sort2.cpp
+
+test_function()
+: realtime_stats.cpp
+
+test_int()
+: shell_sort2.cpp
+
+test_lamniscate()
+: kohonen_som_trace.cpp
+
+test_set
+: brute_force_string_searching.cpp
+
+tests()
+: least_common_multiple.cpp
+
+TH()
+: tower_of_hanoi.cpp
+
+tolowerRoman()
+: decimal_to_roman_numeral.cpp
+
+top
+: paranthesis_matching.cpp
+
+toupperRoman()
+: decimal_to_roman_numeral.cpp
+
+TriangleArea()
+: smallest_circle.cpp
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented file members with links to the documentation:
+
+
+
+
Algorithms_in_C++: File Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: Graph Legend
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This page explains how to interpret the graphs that are generated by doxygen.
+
Consider the following example:
+
class Invisible { };
+
+
+
class Truncated : public Invisible { };
+
+
+
class Undocumented { };
+
+
+
class PublicBase : public Truncated { };
+
+
+
template <class T> class Templ { };
+
+
+
class ProtectedBase { };
+
+
+
class PrivateBase { };
+
+
+
class Used { };
+
+
+
class Inherited : public PublicBase,
+
protected ProtectedBase,
+
private PrivateBase,
+
public Undocumented,
+
public Templ<int>
+
{
+
private :
+
Used *m_usedClass;
+
};
+
This will result in the following graph:
+
The boxes in the above graph have the following meaning:
+
+
+A filled gray box represents the struct or class for which the graph is generated.
+
+A box with a black border denotes a documented struct or class.
+
+A box with a gray border denotes an undocumented struct or class.
+
+A box with a red border denotes a documented struct or class forwhich not all inheritance/containment relations are shown. A graph is truncated if it does not fit within the specified boundaries.
+
+
The arrows have the following meaning:
+
+
+A dark blue arrow is used to visualize a public inheritance relation between two classes.
+
+A dark green arrow is used for protected inheritance.
+
+A dark red arrow is used for private inheritance.
+
+A purple dashed arrow is used if a class is contained or used by another class. The arrow is labelled with the variable(s) through which the pointed class or struct is accessible.
+
+A yellow dashed arrow denotes a relation between a template instance and the template class it was instantiated from. The arrow is labelled with the template parameters of the instance.
+
+
+
+
+Graph Legend
+
+Node9
+Inherited
+
+
+
+Node10
+PublicBase
+
+
+
+Node10->Node9
+
+
+
+Node11
+Truncated
+
+
+
+Node11->Node10
+
+
+
+Node13
+ProtectedBase
+
+
+
+Node13->Node9
+
+
+
+Node14
+PrivateBase
+
+
+
+Node14->Node9
+
+
+
+Node15
+Undocumented
+
+
+
+Node15->Node9
+
+
+
+Node16
+Templ< int >
+
+
+
+Node16->Node9
+
+
+
+Node17
+Templ< T >
+
+
+
+Node17->Node16
+< int >
+
+
+
+Node18
+Used
+
+
+
+Node18->Node9
+m_usedClass
+
+
+
diff --git a/index.html b/index.html
new file mode 100644
index 000000000..ec960ed39
--- /dev/null
+++ b/index.html
@@ -0,0 +1,118 @@
+
+
+
+Algorithms_in_C++: The Algorithms - C++
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Online Documentation .
+
Click on Files menu to see the list of all the files documented with the code.
+
+
The implementations are for learning purpose. They may be less efficient than the implementation in the standard library.
+
+
Read our Contribution Guidelines before you contribute.
+
+
+
+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp($),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+$),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),ne=function(e,t,n){var r="0x"+t-65536;return r!=r||n?t:r<0?String.fromCharCode(r+65536):String.fromCharCode(r>>10|55296,1023&r|56320)},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(m.childNodes),m.childNodes),t[m.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&((e?e.ownerDocument||e:m)!==C&&T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!A[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&U.test(t)){(s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=k),o=(l=h(t)).length;while(o--)l[o]="#"+s+" "+xe(l[o]);c=l.join(","),f=ee.test(t)&&ye(e.parentNode)||e}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){A(t,!0)}finally{s===k&&e.removeAttribute("id")}}}return g(t.replace(B,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[k]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:m;return r!==C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),m!==C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=k,!C.getElementsByName||!C.getElementsByName(k).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){a.appendChild(e).innerHTML="":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=p[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&p(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?k.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?k.grep(e,function(e){return e===n!==r}):"string"!=typeof n?k.grep(e,function(e){return-1)[^>]*|#([\w-]+))$/;(k.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||q,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:L.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof k?t[0]:t,k.merge(this,k.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),D.test(r[1])&&k.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(k):k.makeArray(e,this)}).prototype=k.fn,q=k(E);var H=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}k.fn.extend({has:function(e){var t=k(e,this),n=t.length;return this.filter(function(){for(var e=0;e\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i,ge={option:[1,""," "],thead:[1,""],col:[2,""],tr:[2,""],td:[3,""],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?k.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;nx",y.noCloneChecked=!!me.cloneNode(!0).lastChild.defaultValue;var Te=/^key/,Ce=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Ee=/^([^.]*)(?:\.(.+)|)/;function ke(){return!0}function Se(){return!1}function Ne(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ae(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ae(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Se;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return k().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=k.guid++)),e.each(function(){k.event.add(this,t,i,r,n)})}function De(e,i,o){o?(Q.set(e,i,!1),k.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Q.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(k.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Q.set(this,i,r),t=o(this,i),this[i](),r!==(n=Q.get(this,i))||t?Q.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Q.set(this,i,{value:k.event.trigger(k.extend(r[0],k.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Q.get(e,i)&&k.event.add(e,i,ke)}k.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.get(t);if(v){n.handler&&(n=(o=n).handler,i=o.selector),i&&k.find.matchesSelector(ie,i),n.guid||(n.guid=k.guid++),(u=v.events)||(u=v.events={}),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof k&&k.event.triggered!==e.type?k.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(R)||[""]).length;while(l--)d=g=(s=Ee.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=k.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=k.event.special[d]||{},c=k.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&k.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),k.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.hasData(e)&&Q.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(R)||[""]).length;while(l--)if(d=g=(s=Ee.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=k.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||k.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)k.event.remove(e,d+t[l],n,r,!0);k.isEmptyObject(u)&&Q.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=k.event.fix(e),u=new Array(arguments.length),l=(Q.get(this,"events")||{})[s.type]||[],c=k.event.special[s.type]||{};for(u[0]=s,t=1;t\x20\t\r\n\f]*)[^>]*)\/>/gi,qe=/\s*$/g;function Oe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&k(e).children("tbody")[0]||e}function Pe(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Re(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Me(e,t){var n,r,i,o,a,s,u,l;if(1===t.nodeType){if(Q.hasData(e)&&(o=Q.access(e),a=Q.set(t,o),l=o.events))for(i in delete a.handle,a.events={},l)for(n=0,r=l[i].length;n")},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=oe(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||k.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Vt,Gt=[],Yt=/(=)\?(?=&|$)|\?\?/;k.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Gt.pop()||k.expando+"_"+kt++;return this[e]=!0,e}}),k.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Yt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Yt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Yt,"$1"+r):!1!==e.jsonp&&(e.url+=(St.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||k.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?k(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Gt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Vt=E.implementation.createHTMLDocument("").body).innerHTML="",2===Vt.childNodes.length),k.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=D.exec(e))?[t.createElement(i[1])]:(i=we([e],t,o),o&&o.length&&k(o).remove(),k.merge([],i.childNodes)));var r,i,o},k.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1").append(k.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},k.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){k.fn[t]=function(e){return this.on(t,e)}}),k.expr.pseudos.animated=function(t){return k.grep(k.timers,function(e){return t===e.elem}).length},k.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=k.css(e,"position"),c=k(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=k.css(e,"top"),u=k.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,k.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},k.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){k.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===k.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===k.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=k(e).offset()).top+=k.css(e,"borderTopWidth",!0),i.left+=k.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-k.css(r,"marginTop",!0),left:t.left-i.left-k.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===k.css(e,"position"))e=e.offsetParent;return e||ie})}}),k.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;k.fn[t]=function(e){return _(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),k.each(["top","left"],function(e,n){k.cssHooks[n]=ze(y.pixelPosition,function(e,t){if(t)return t=_e(e,n),$e.test(t)?k(e).position()[n]+"px":t})}),k.each({Height:"height",Width:"width"},function(a,s){k.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){k.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return _(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?k.css(e,t,i):k.style(e,t,n,i)},s,n?e:void 0,n)}})}),k.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){k.fn[n]=function(e,t){return 0a;a++)for(i in o[a])n=o[a][i],o[a].hasOwnProperty(i)&&void 0!==n&&(e[i]=t.isPlainObject(n)?t.isPlainObject(e[i])?t.widget.extend({},e[i],n):t.widget.extend({},n):n);return e},t.widget.bridge=function(e,i){var n=i.prototype.widgetFullName||e;t.fn[e]=function(o){var a="string"==typeof o,r=s.call(arguments,1),h=this;return a?this.length||"instance"!==o?this.each(function(){var i,s=t.data(this,n);return"instance"===o?(h=s,!1):s?t.isFunction(s[o])&&"_"!==o.charAt(0)?(i=s[o].apply(s,r),i!==s&&void 0!==i?(h=i&&i.jquery?h.pushStack(i.get()):i,!1):void 0):t.error("no such method '"+o+"' for "+e+" widget instance"):t.error("cannot call methods on "+e+" prior to initialization; "+"attempted to call method '"+o+"'")}):h=void 0:(r.length&&(o=t.widget.extend.apply(null,[o].concat(r))),this.each(function(){var e=t.data(this,n);e?(e.option(o||{}),e._init&&e._init()):t.data(this,n,new i(o,this))})),h}},t.Widget=function(){},t.Widget._childConstructors=[],t.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"",options:{classes:{},disabled:!1,create:null},_createWidget:function(e,s){s=t(s||this.defaultElement||this)[0],this.element=t(s),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=t(),this.hoverable=t(),this.focusable=t(),this.classesElementLookup={},s!==this&&(t.data(s,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===s&&this.destroy()}}),this.document=t(s.style?s.ownerDocument:s.document||s),this.window=t(this.document[0].defaultView||this.document[0].parentWindow)),this.options=t.widget.extend({},this.options,this._getCreateOptions(),e),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:t.noop,_create:t.noop,_init:t.noop,destroy:function(){var e=this;this._destroy(),t.each(this.classesElementLookup,function(t,i){e._removeClass(i,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:t.noop,widget:function(){return this.element},option:function(e,i){var s,n,o,a=e;if(0===arguments.length)return t.widget.extend({},this.options);if("string"==typeof e)if(a={},s=e.split("."),e=s.shift(),s.length){for(n=a[e]=t.widget.extend({},this.options[e]),o=0;s.length-1>o;o++)n[s[o]]=n[s[o]]||{},n=n[s[o]];if(e=s.pop(),1===arguments.length)return void 0===n[e]?null:n[e];n[e]=i}else{if(1===arguments.length)return void 0===this.options[e]?null:this.options[e];a[e]=i}return this._setOptions(a),this},_setOptions:function(t){var e;for(e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(e){var i,s,n;for(i in e)n=this.classesElementLookup[i],e[i]!==this.options.classes[i]&&n&&n.length&&(s=t(n.get()),this._removeClass(n,i),s.addClass(this._classes({element:s,keys:i,classes:e,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(e){function i(i,o){var a,r;for(r=0;i.length>r;r++)a=n.classesElementLookup[i[r]]||t(),a=e.add?t(t.unique(a.get().concat(e.element.get()))):t(a.not(e.element).get()),n.classesElementLookup[i[r]]=a,s.push(i[r]),o&&e.classes[i[r]]&&s.push(e.classes[i[r]])}var s=[],n=this;return e=t.extend({element:this.element,classes:this.options.classes||{}},e),this._on(e.element,{remove:"_untrackClassesElement"}),e.keys&&i(e.keys.match(/\S+/g)||[],!0),e.extra&&i(e.extra.match(/\S+/g)||[]),s.join(" ")},_untrackClassesElement:function(e){var i=this;t.each(i.classesElementLookup,function(s,n){-1!==t.inArray(e.target,n)&&(i.classesElementLookup[s]=t(n.not(e.target).get()))})},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){s="boolean"==typeof s?s:i;var n="string"==typeof t||null===t,o={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s};return o.element.toggleClass(this._classes(o),s),this},_on:function(e,i,s){var n,o=this;"boolean"!=typeof e&&(s=i,i=e,e=!1),s?(i=n=t(i),this.bindings=this.bindings.add(i)):(s=i,i=this.element,n=this.widget()),t.each(s,function(s,a){function r(){return e||o.options.disabled!==!0&&!t(this).hasClass("ui-state-disabled")?("string"==typeof a?o[a]:a).apply(o,arguments):void 0}"string"!=typeof a&&(r.guid=a.guid=a.guid||r.guid||t.guid++);var h=s.match(/^([\w:-]*)\s*(.*)$/),l=h[1]+o.eventNamespace,c=h[2];c?n.on(l,c,r):i.on(l,r)})},_off:function(e,i){i=(i||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,e.off(i).off(i),this.bindings=t(this.bindings.not(e).get()),this.focusable=t(this.focusable.not(e).get()),this.hoverable=t(this.hoverable.not(e).get())},_delay:function(t,e){function i(){return("string"==typeof t?s[t]:t).apply(s,arguments)}var s=this;return setTimeout(i,e||0)},_hoverable:function(e){this.hoverable=this.hoverable.add(e),this._on(e,{mouseenter:function(e){this._addClass(t(e.currentTarget),null,"ui-state-hover")},mouseleave:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-hover")}})},_focusable:function(e){this.focusable=this.focusable.add(e),this._on(e,{focusin:function(e){this._addClass(t(e.currentTarget),null,"ui-state-focus")},focusout:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-focus")}})},_trigger:function(e,i,s){var n,o,a=this.options[e];if(s=s||{},i=t.Event(i),i.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase(),i.target=this.element[0],o=i.originalEvent)for(n in o)n in i||(i[n]=o[n]);return this.element.trigger(i,s),!(t.isFunction(a)&&a.apply(this.element[0],[i].concat(s))===!1||i.isDefaultPrevented())}},t.each({show:"fadeIn",hide:"fadeOut"},function(e,i){t.Widget.prototype["_"+e]=function(s,n,o){"string"==typeof n&&(n={effect:n});var a,r=n?n===!0||"number"==typeof n?i:n.effect||i:e;n=n||{},"number"==typeof n&&(n={duration:n}),a=!t.isEmptyObject(n),n.complete=o,n.delay&&s.delay(n.delay),a&&t.effects&&t.effects.effect[r]?s[e](n):r!==e&&s[r]?s[r](n.duration,n.easing,o):s.queue(function(i){t(this)[e](),o&&o.call(s[0]),i()})}}),t.widget,function(){function e(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function i(e,i){return parseInt(t.css(e,i),10)||0}function s(e){var i=e[0];return 9===i.nodeType?{width:e.width(),height:e.height(),offset:{top:0,left:0}}:t.isWindow(i)?{width:e.width(),height:e.height(),offset:{top:e.scrollTop(),left:e.scrollLeft()}}:i.preventDefault?{width:0,height:0,offset:{top:i.pageY,left:i.pageX}}:{width:e.outerWidth(),height:e.outerHeight(),offset:e.offset()}}var n,o=Math.max,a=Math.abs,r=/left|center|right/,h=/top|center|bottom/,l=/[\+\-]\d+(\.[\d]+)?%?/,c=/^\w+/,u=/%$/,d=t.fn.position;t.position={scrollbarWidth:function(){if(void 0!==n)return n;var e,i,s=t("
"),o=s.children()[0];return t("body").append(s),e=o.offsetWidth,s.css("overflow","scroll"),i=o.offsetWidth,e===i&&(i=s[0].clientWidth),s.remove(),n=e-i},getScrollInfo:function(e){var i=e.isWindow||e.isDocument?"":e.element.css("overflow-x"),s=e.isWindow||e.isDocument?"":e.element.css("overflow-y"),n="scroll"===i||"auto"===i&&e.width
i?"left":e>0?"right":"center",vertical:0>r?"top":s>0?"bottom":"middle"};l>p&&p>a(e+i)&&(u.horizontal="center"),c>f&&f>a(s+r)&&(u.vertical="middle"),u.important=o(a(e),a(i))>o(a(s),a(r))?"horizontal":"vertical",n.using.call(this,t,u)}),h.offset(t.extend(D,{using:r}))})},t.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,a=s.width,r=t.left-e.collisionPosition.marginLeft,h=n-r,l=r+e.collisionWidth-a-n;e.collisionWidth>a?h>0&&0>=l?(i=t.left+h+e.collisionWidth-a-n,t.left+=h-i):t.left=l>0&&0>=h?n:h>l?n+a-e.collisionWidth:n:h>0?t.left+=h:l>0?t.left-=l:t.left=o(t.left-r,t.left)},top:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollTop:s.offset.top,a=e.within.height,r=t.top-e.collisionPosition.marginTop,h=n-r,l=r+e.collisionHeight-a-n;e.collisionHeight>a?h>0&&0>=l?(i=t.top+h+e.collisionHeight-a-n,t.top+=h-i):t.top=l>0&&0>=h?n:h>l?n+a-e.collisionHeight:n:h>0?t.top+=h:l>0?t.top-=l:t.top=o(t.top-r,t.top)}},flip:{left:function(t,e){var i,s,n=e.within,o=n.offset.left+n.scrollLeft,r=n.width,h=n.isWindow?n.scrollLeft:n.offset.left,l=t.left-e.collisionPosition.marginLeft,c=l-h,u=l+e.collisionWidth-r-h,d="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,p="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,f=-2*e.offset[0];0>c?(i=t.left+d+p+f+e.collisionWidth-r-o,(0>i||a(c)>i)&&(t.left+=d+p+f)):u>0&&(s=t.left-e.collisionPosition.marginLeft+d+p+f-h,(s>0||u>a(s))&&(t.left+=d+p+f))},top:function(t,e){var i,s,n=e.within,o=n.offset.top+n.scrollTop,r=n.height,h=n.isWindow?n.scrollTop:n.offset.top,l=t.top-e.collisionPosition.marginTop,c=l-h,u=l+e.collisionHeight-r-h,d="top"===e.my[1],p=d?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,f="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,m=-2*e.offset[1];0>c?(s=t.top+p+f+m+e.collisionHeight-r-o,(0>s||a(c)>s)&&(t.top+=p+f+m)):u>0&&(i=t.top-e.collisionPosition.marginTop+p+f+m-h,(i>0||u>a(i))&&(t.top+=p+f+m))}},flipfit:{left:function(){t.ui.position.flip.left.apply(this,arguments),t.ui.position.fit.left.apply(this,arguments)},top:function(){t.ui.position.flip.top.apply(this,arguments),t.ui.position.fit.top.apply(this,arguments)}}}}(),t.ui.position,t.extend(t.expr[":"],{data:t.expr.createPseudo?t.expr.createPseudo(function(e){return function(i){return!!t.data(i,e)}}):function(e,i,s){return!!t.data(e,s[3])}}),t.fn.extend({disableSelection:function(){var t="onselectstart"in document.createElement("div")?"selectstart":"mousedown";return function(){return this.on(t+".ui-disableSelection",function(t){t.preventDefault()})}}(),enableSelection:function(){return this.off(".ui-disableSelection")}}),t.ui.focusable=function(i,s){var n,o,a,r,h,l=i.nodeName.toLowerCase();return"area"===l?(n=i.parentNode,o=n.name,i.href&&o&&"map"===n.nodeName.toLowerCase()?(a=t("img[usemap='#"+o+"']"),a.length>0&&a.is(":visible")):!1):(/^(input|select|textarea|button|object)$/.test(l)?(r=!i.disabled,r&&(h=t(i).closest("fieldset")[0],h&&(r=!h.disabled))):r="a"===l?i.href||s:s,r&&t(i).is(":visible")&&e(t(i)))},t.extend(t.expr[":"],{focusable:function(e){return t.ui.focusable(e,null!=t.attr(e,"tabindex"))}}),t.ui.focusable,t.fn.form=function(){return"string"==typeof this[0].form?this.closest("form"):t(this[0].form)},t.ui.formResetMixin={_formResetHandler:function(){var e=t(this);setTimeout(function(){var i=e.data("ui-form-reset-instances");t.each(i,function(){this.refresh()})})},_bindFormResetHandler:function(){if(this.form=this.element.form(),this.form.length){var t=this.form.data("ui-form-reset-instances")||[];t.length||this.form.on("reset.ui-form-reset",this._formResetHandler),t.push(this),this.form.data("ui-form-reset-instances",t)}},_unbindFormResetHandler:function(){if(this.form.length){var e=this.form.data("ui-form-reset-instances");e.splice(t.inArray(this,e),1),e.length?this.form.data("ui-form-reset-instances",e):this.form.removeData("ui-form-reset-instances").off("reset.ui-form-reset")}}},"1.7"===t.fn.jquery.substring(0,3)&&(t.each(["Width","Height"],function(e,i){function s(e,i,s,o){return t.each(n,function(){i-=parseFloat(t.css(e,"padding"+this))||0,s&&(i-=parseFloat(t.css(e,"border"+this+"Width"))||0),o&&(i-=parseFloat(t.css(e,"margin"+this))||0)}),i}var n="Width"===i?["Left","Right"]:["Top","Bottom"],o=i.toLowerCase(),a={innerWidth:t.fn.innerWidth,innerHeight:t.fn.innerHeight,outerWidth:t.fn.outerWidth,outerHeight:t.fn.outerHeight};t.fn["inner"+i]=function(e){return void 0===e?a["inner"+i].call(this):this.each(function(){t(this).css(o,s(this,e)+"px")})},t.fn["outer"+i]=function(e,n){return"number"!=typeof e?a["outer"+i].call(this,e):this.each(function(){t(this).css(o,s(this,e,!0,n)+"px")})}}),t.fn.addBack=function(t){return this.add(null==t?this.prevObject:this.prevObject.filter(t))}),t.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},t.ui.escapeSelector=function(){var t=/([!"#$%&'()*+,./:;<=>?@[\]^`{|}~])/g;return function(e){return e.replace(t,"\\$1")}}(),t.fn.labels=function(){var e,i,s,n,o;return this[0].labels&&this[0].labels.length?this.pushStack(this[0].labels):(n=this.eq(0).parents("label"),s=this.attr("id"),s&&(e=this.eq(0).parents().last(),o=e.add(e.length?e.siblings():this.siblings()),i="label[for='"+t.ui.escapeSelector(s)+"']",n=n.add(o.find(i).addBack(i))),this.pushStack(n))},t.fn.scrollParent=function(e){var i=this.css("position"),s="absolute"===i,n=e?/(auto|scroll|hidden)/:/(auto|scroll)/,o=this.parents().filter(function(){var e=t(this);return s&&"static"===e.css("position")?!1:n.test(e.css("overflow")+e.css("overflow-y")+e.css("overflow-x"))}).eq(0);return"fixed"!==i&&o.length?o:t(this[0].ownerDocument||document)},t.extend(t.expr[":"],{tabbable:function(e){var i=t.attr(e,"tabindex"),s=null!=i;return(!s||i>=0)&&t.ui.focusable(e,s)}}),t.fn.extend({uniqueId:function(){var t=0;return function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}}(),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&t(this).removeAttr("id")})}}),t.ui.ie=!!/msie [\w.]+/.exec(navigator.userAgent.toLowerCase());var n=!1;t(document).on("mouseup",function(){n=!1}),t.widget("ui.mouse",{version:"1.12.1",options:{cancel:"input, textarea, button, select, option",distance:1,delay:0},_mouseInit:function(){var e=this;this.element.on("mousedown."+this.widgetName,function(t){return e._mouseDown(t)}).on("click."+this.widgetName,function(i){return!0===t.data(i.target,e.widgetName+".preventClickEvent")?(t.removeData(i.target,e.widgetName+".preventClickEvent"),i.stopImmediatePropagation(),!1):void 0}),this.started=!1},_mouseDestroy:function(){this.element.off("."+this.widgetName),this._mouseMoveDelegate&&this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate)},_mouseDown:function(e){if(!n){this._mouseMoved=!1,this._mouseStarted&&this._mouseUp(e),this._mouseDownEvent=e;var i=this,s=1===e.which,o="string"==typeof this.options.cancel&&e.target.nodeName?t(e.target).closest(this.options.cancel).length:!1;return s&&!o&&this._mouseCapture(e)?(this.mouseDelayMet=!this.options.delay,this.mouseDelayMet||(this._mouseDelayTimer=setTimeout(function(){i.mouseDelayMet=!0},this.options.delay)),this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(e)!==!1,!this._mouseStarted)?(e.preventDefault(),!0):(!0===t.data(e.target,this.widgetName+".preventClickEvent")&&t.removeData(e.target,this.widgetName+".preventClickEvent"),this._mouseMoveDelegate=function(t){return i._mouseMove(t)},this._mouseUpDelegate=function(t){return i._mouseUp(t)},this.document.on("mousemove."+this.widgetName,this._mouseMoveDelegate).on("mouseup."+this.widgetName,this._mouseUpDelegate),e.preventDefault(),n=!0,!0)):!0}},_mouseMove:function(e){if(this._mouseMoved){if(t.ui.ie&&(!document.documentMode||9>document.documentMode)&&!e.button)return this._mouseUp(e);if(!e.which)if(e.originalEvent.altKey||e.originalEvent.ctrlKey||e.originalEvent.metaKey||e.originalEvent.shiftKey)this.ignoreMissingWhich=!0;else if(!this.ignoreMissingWhich)return this._mouseUp(e)}return(e.which||e.button)&&(this._mouseMoved=!0),this._mouseStarted?(this._mouseDrag(e),e.preventDefault()):(this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(this._mouseDownEvent,e)!==!1,this._mouseStarted?this._mouseDrag(e):this._mouseUp(e)),!this._mouseStarted)},_mouseUp:function(e){this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate),this._mouseStarted&&(this._mouseStarted=!1,e.target===this._mouseDownEvent.target&&t.data(e.target,this.widgetName+".preventClickEvent",!0),this._mouseStop(e)),this._mouseDelayTimer&&(clearTimeout(this._mouseDelayTimer),delete this._mouseDelayTimer),this.ignoreMissingWhich=!1,n=!1,e.preventDefault()},_mouseDistanceMet:function(t){return Math.max(Math.abs(this._mouseDownEvent.pageX-t.pageX),Math.abs(this._mouseDownEvent.pageY-t.pageY))>=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),t.ui.plugin={add:function(e,i,s){var n,o=t.ui[e].prototype;for(n in s)o.plugins[n]=o.plugins[n]||[],o.plugins[n].push([i,s[n]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;o.length>n;n++)t.options[o[n][0]]&&o[n][1].apply(t.element,i)}},t.widget("ui.resizable",t.ui.mouse,{version:"1.12.1",widgetEventPrefix:"resize",options:{alsoResize:!1,animate:!1,animateDuration:"slow",animateEasing:"swing",aspectRatio:!1,autoHide:!1,classes:{"ui-resizable-se":"ui-icon ui-icon-gripsmall-diagonal-se"},containment:!1,ghost:!1,grid:!1,handles:"e,s,se",helper:!1,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:90,resize:null,start:null,stop:null},_num:function(t){return parseFloat(t)||0},_isNumber:function(t){return!isNaN(parseFloat(t))},_hasScroll:function(e,i){if("hidden"===t(e).css("overflow"))return!1;var s=i&&"left"===i?"scrollLeft":"scrollTop",n=!1;return e[s]>0?!0:(e[s]=1,n=e[s]>0,e[s]=0,n)},_create:function(){var e,i=this.options,s=this;this._addClass("ui-resizable"),t.extend(this,{_aspectRatio:!!i.aspectRatio,aspectRatio:i.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:i.helper||i.ghost||i.animate?i.helper||"ui-resizable-helper":null}),this.element[0].nodeName.match(/^(canvas|textarea|input|select|button|img)$/i)&&(this.element.wrap(t("
").css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})),this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,e={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(e),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(e),this._proportionallyResize()),this._setupHandles(),i.autoHide&&t(this.element).on("mouseenter",function(){i.disabled||(s._removeClass("ui-resizable-autohide"),s._handles.show())}).on("mouseleave",function(){i.disabled||s.resizing||(s._addClass("ui-resizable-autohide"),s._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy();var e,i=function(e){t(e).removeData("resizable").removeData("ui-resizable").off(".resizable").find(".ui-resizable-handle").remove()};return this.elementIsWrapper&&(i(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),i(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;default:}},_setupHandles:function(){var e,i,s,n,o,a=this.options,r=this;if(this.handles=a.handles||(t(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=t(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),s=this.handles.split(","),this.handles={},i=0;s.length>i;i++)e=t.trim(s[i]),n="ui-resizable-"+e,o=t(""),this._addClass(o,"ui-resizable-handle "+n),o.css({zIndex:a.zIndex}),this.handles[e]=".ui-resizable-"+e,this.element.append(o);this._renderAxis=function(e){var i,s,n,o;e=e||this.element;for(i in this.handles)this.handles[i].constructor===String?this.handles[i]=this.element.children(this.handles[i]).first().show():(this.handles[i].jquery||this.handles[i].nodeType)&&(this.handles[i]=t(this.handles[i]),this._on(this.handles[i],{mousedown:r._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(s=t(this.handles[i],this.element),o=/sw|ne|nw|se|n|s/.test(i)?s.outerHeight():s.outerWidth(),n=["padding",/ne|nw|n/.test(i)?"Top":/se|sw|s/.test(i)?"Bottom":/^e$/.test(i)?"Right":"Left"].join(""),e.css(n,o),this._proportionallyResize()),this._handles=this._handles.add(this.handles[i])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){r.resizing||(this.className&&(o=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),r.axis=o&&o[1]?o[1]:"se")}),a.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._handles.remove()},_mouseCapture:function(e){var i,s,n=!1;for(i in this.handles)s=t(this.handles[i])[0],(s===e.target||t.contains(s,e.target))&&(n=!0);return!this.options.disabled&&n},_mouseStart:function(e){var i,s,n,o=this.options,a=this.element;return this.resizing=!0,this._renderProxy(),i=this._num(this.helper.css("left")),s=this._num(this.helper.css("top")),o.containment&&(i+=t(o.containment).scrollLeft()||0,s+=t(o.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:i,top:s},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{width:a.width(),height:a.height()},this.originalSize=this._helper?{width:a.outerWidth(),height:a.outerHeight()}:{width:a.width(),height:a.height()},this.sizeDiff={width:a.outerWidth()-a.width(),height:a.outerHeight()-a.height()},this.originalPosition={left:i,top:s},this.originalMousePosition={left:e.pageX,top:e.pageY},this.aspectRatio="number"==typeof o.aspectRatio?o.aspectRatio:this.originalSize.width/this.originalSize.height||1,n=t(".ui-resizable-"+this.axis).css("cursor"),t("body").css("cursor","auto"===n?this.axis+"-resize":n),this._addClass("ui-resizable-resizing"),this._propagate("start",e),!0},_mouseDrag:function(e){var i,s,n=this.originalMousePosition,o=this.axis,a=e.pageX-n.left||0,r=e.pageY-n.top||0,h=this._change[o];return this._updatePrevProperties(),h?(i=h.apply(this,[e,a,r]),this._updateVirtualBoundaries(e.shiftKey),(this._aspectRatio||e.shiftKey)&&(i=this._updateRatio(i,e)),i=this._respectSize(i,e),this._updateCache(i),this._propagate("resize",e),s=this._applyChanges(),!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),t.isEmptyObject(s)||(this._updatePrevProperties(),this._trigger("resize",e,this.ui()),this._applyChanges()),!1):!1},_mouseStop:function(e){this.resizing=!1;var i,s,n,o,a,r,h,l=this.options,c=this;return this._helper&&(i=this._proportionallyResizeElements,s=i.length&&/textarea/i.test(i[0].nodeName),n=s&&this._hasScroll(i[0],"left")?0:c.sizeDiff.height,o=s?0:c.sizeDiff.width,a={width:c.helper.width()-o,height:c.helper.height()-n},r=parseFloat(c.element.css("left"))+(c.position.left-c.originalPosition.left)||null,h=parseFloat(c.element.css("top"))+(c.position.top-c.originalPosition.top)||null,l.animate||this.element.css(t.extend(a,{top:h,left:r})),c.helper.height(c.size.height),c.helper.width(c.size.width),this._helper&&!l.animate&&this._proportionallyResize()),t("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",e),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s,n,o,a=this.options;o={minWidth:this._isNumber(a.minWidth)?a.minWidth:0,maxWidth:this._isNumber(a.maxWidth)?a.maxWidth:1/0,minHeight:this._isNumber(a.minHeight)?a.minHeight:0,maxHeight:this._isNumber(a.maxHeight)?a.maxHeight:1/0},(this._aspectRatio||t)&&(e=o.minHeight*this.aspectRatio,s=o.minWidth/this.aspectRatio,i=o.maxHeight*this.aspectRatio,n=o.maxWidth/this.aspectRatio,e>o.minWidth&&(o.minWidth=e),s>o.minHeight&&(o.minHeight=s),o.maxWidth>i&&(o.maxWidth=i),o.maxHeight>n&&(o.maxHeight=n)),this._vBoundaries=o},_updateCache:function(t){this.offset=this.helper.offset(),this._isNumber(t.left)&&(this.position.left=t.left),this._isNumber(t.top)&&(this.position.top=t.top),this._isNumber(t.height)&&(this.size.height=t.height),this._isNumber(t.width)&&(this.size.width=t.width)},_updateRatio:function(t){var e=this.position,i=this.size,s=this.axis;return this._isNumber(t.height)?t.width=t.height*this.aspectRatio:this._isNumber(t.width)&&(t.height=t.width/this.aspectRatio),"sw"===s&&(t.left=e.left+(i.width-t.width),t.top=null),"nw"===s&&(t.top=e.top+(i.height-t.height),t.left=e.left+(i.width-t.width)),t},_respectSize:function(t){var e=this._vBoundaries,i=this.axis,s=this._isNumber(t.width)&&e.maxWidth&&e.maxWidth
t.width,a=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,r=this.originalPosition.left+this.originalSize.width,h=this.originalPosition.top+this.originalSize.height,l=/sw|nw|w/.test(i),c=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),a&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=r-e.minWidth),s&&l&&(t.left=r-e.maxWidth),a&&c&&(t.top=h-e.minHeight),n&&c&&(t.top=h-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];4>e;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;this._proportionallyResizeElements.length>e;e++)t=this._proportionallyResizeElements[e],this.outerDimensions||(this.outerDimensions=this._getPaddingPlusBorderDimensions(t)),t.css({height:i.height()-this.outerDimensions.height||0,width:i.width()-this.outerDimensions.width||0})},_renderProxy:function(){var e=this.element,i=this.options;this.elementOffset=e.offset(),this._helper?(this.helper=this.helper||t("
"),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++i.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element
+},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize,s=this.originalPosition;return{left:s.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize,n=this.originalPosition;return{top:n.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},sw:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[e,i,s]))},ne:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},nw:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[e,i,s]))}},_propagate:function(e,i){t.ui.plugin.call(this,e,[i,this.ui()]),"resize"!==e&&this._trigger(e,i,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),t.ui.plugin.add("resizable","animate",{stop:function(e){var i=t(this).resizable("instance"),s=i.options,n=i._proportionallyResizeElements,o=n.length&&/textarea/i.test(n[0].nodeName),a=o&&i._hasScroll(n[0],"left")?0:i.sizeDiff.height,r=o?0:i.sizeDiff.width,h={width:i.size.width-r,height:i.size.height-a},l=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left)||null,c=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(t.extend(h,c&&l?{top:c,left:l}:{}),{duration:s.animateDuration,easing:s.animateEasing,step:function(){var s={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};n&&n.length&&t(n[0]).css({width:s.width,height:s.height}),i._updateCache(s),i._propagate("resize",e)}})}}),t.ui.plugin.add("resizable","containment",{start:function(){var e,i,s,n,o,a,r,h=t(this).resizable("instance"),l=h.options,c=h.element,u=l.containment,d=u instanceof t?u.get(0):/parent/.test(u)?c.parent().get(0):u;d&&(h.containerElement=t(d),/document/.test(u)||u===document?(h.containerOffset={left:0,top:0},h.containerPosition={left:0,top:0},h.parentData={element:t(document),left:0,top:0,width:t(document).width(),height:t(document).height()||document.body.parentNode.scrollHeight}):(e=t(d),i=[],t(["Top","Right","Left","Bottom"]).each(function(t,s){i[t]=h._num(e.css("padding"+s))}),h.containerOffset=e.offset(),h.containerPosition=e.position(),h.containerSize={height:e.innerHeight()-i[3],width:e.innerWidth()-i[1]},s=h.containerOffset,n=h.containerSize.height,o=h.containerSize.width,a=h._hasScroll(d,"left")?d.scrollWidth:o,r=h._hasScroll(d)?d.scrollHeight:n,h.parentData={element:d,left:s.left,top:s.top,width:a,height:r}))},resize:function(e){var i,s,n,o,a=t(this).resizable("instance"),r=a.options,h=a.containerOffset,l=a.position,c=a._aspectRatio||e.shiftKey,u={top:0,left:0},d=a.containerElement,p=!0;d[0]!==document&&/static/.test(d.css("position"))&&(u=h),l.left<(a._helper?h.left:0)&&(a.size.width=a.size.width+(a._helper?a.position.left-h.left:a.position.left-u.left),c&&(a.size.height=a.size.width/a.aspectRatio,p=!1),a.position.left=r.helper?h.left:0),l.top<(a._helper?h.top:0)&&(a.size.height=a.size.height+(a._helper?a.position.top-h.top:a.position.top),c&&(a.size.width=a.size.height*a.aspectRatio,p=!1),a.position.top=a._helper?h.top:0),n=a.containerElement.get(0)===a.element.parent().get(0),o=/relative|absolute/.test(a.containerElement.css("position")),n&&o?(a.offset.left=a.parentData.left+a.position.left,a.offset.top=a.parentData.top+a.position.top):(a.offset.left=a.element.offset().left,a.offset.top=a.element.offset().top),i=Math.abs(a.sizeDiff.width+(a._helper?a.offset.left-u.left:a.offset.left-h.left)),s=Math.abs(a.sizeDiff.height+(a._helper?a.offset.top-u.top:a.offset.top-h.top)),i+a.size.width>=a.parentData.width&&(a.size.width=a.parentData.width-i,c&&(a.size.height=a.size.width/a.aspectRatio,p=!1)),s+a.size.height>=a.parentData.height&&(a.size.height=a.parentData.height-s,c&&(a.size.width=a.size.height*a.aspectRatio,p=!1)),p||(a.position.left=a.prevPosition.left,a.position.top=a.prevPosition.top,a.size.width=a.prevSize.width,a.size.height=a.prevSize.height)},stop:function(){var e=t(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.containerPosition,o=e.containerElement,a=t(e.helper),r=a.offset(),h=a.outerWidth()-e.sizeDiff.width,l=a.outerHeight()-e.sizeDiff.height;e._helper&&!i.animate&&/relative/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l}),e._helper&&!i.animate&&/static/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l})}}),t.ui.plugin.add("resizable","alsoResize",{start:function(){var e=t(this).resizable("instance"),i=e.options;t(i.alsoResize).each(function(){var e=t(this);e.data("ui-resizable-alsoresize",{width:parseFloat(e.width()),height:parseFloat(e.height()),left:parseFloat(e.css("left")),top:parseFloat(e.css("top"))})})},resize:function(e,i){var s=t(this).resizable("instance"),n=s.options,o=s.originalSize,a=s.originalPosition,r={height:s.size.height-o.height||0,width:s.size.width-o.width||0,top:s.position.top-a.top||0,left:s.position.left-a.left||0};t(n.alsoResize).each(function(){var e=t(this),s=t(this).data("ui-resizable-alsoresize"),n={},o=e.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];t.each(o,function(t,e){var i=(s[e]||0)+(r[e]||0);i&&i>=0&&(n[e]=i||null)}),e.css(n)})},stop:function(){t(this).removeData("ui-resizable-alsoresize")}}),t.ui.plugin.add("resizable","ghost",{start:function(){var e=t(this).resizable("instance"),i=e.size;e.ghost=e.originalElement.clone(),e.ghost.css({opacity:.25,display:"block",position:"relative",height:i.height,width:i.width,margin:0,left:0,top:0}),e._addClass(e.ghost,"ui-resizable-ghost"),t.uiBackCompat!==!1&&"string"==typeof e.options.ghost&&e.ghost.addClass(this.options.ghost),e.ghost.appendTo(e.helper)},resize:function(){var e=t(this).resizable("instance");e.ghost&&e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})},stop:function(){var e=t(this).resizable("instance");e.ghost&&e.helper&&e.helper.get(0).removeChild(e.ghost.get(0))}}),t.ui.plugin.add("resizable","grid",{resize:function(){var e,i=t(this).resizable("instance"),s=i.options,n=i.size,o=i.originalSize,a=i.originalPosition,r=i.axis,h="number"==typeof s.grid?[s.grid,s.grid]:s.grid,l=h[0]||1,c=h[1]||1,u=Math.round((n.width-o.width)/l)*l,d=Math.round((n.height-o.height)/c)*c,p=o.width+u,f=o.height+d,m=s.maxWidth&&p>s.maxWidth,g=s.maxHeight&&f>s.maxHeight,_=s.minWidth&&s.minWidth>p,v=s.minHeight&&s.minHeight>f;s.grid=h,_&&(p+=l),v&&(f+=c),m&&(p-=l),g&&(f-=c),/^(se|s|e)$/.test(r)?(i.size.width=p,i.size.height=f):/^(ne)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.top=a.top-d):/^(sw)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.left=a.left-u):((0>=f-c||0>=p-l)&&(e=i._getPaddingPlusBorderDimensions(this)),f-c>0?(i.size.height=f,i.position.top=a.top-d):(f=c-e.height,i.size.height=f,i.position.top=a.top+o.height-f),p-l>0?(i.size.width=p,i.position.left=a.left-u):(p=l-e.width,i.size.width=p,i.position.left=a.left+o.width-p))}}),t.ui.resizable});/**
+ * Copyright (c) 2007 Ariel Flesler - aflesler ○ gmail • com | https://github.com/flesler
+ * Licensed under MIT
+ * @author Ariel Flesler
+ * @version 2.1.2
+ */
+;(function(f){"use strict";"function"===typeof define&&define.amd?define(["jquery"],f):"undefined"!==typeof module&&module.exports?module.exports=f(require("jquery")):f(jQuery)})(function($){"use strict";function n(a){return!a.nodeName||-1!==$.inArray(a.nodeName.toLowerCase(),["iframe","#document","html","body"])}function h(a){return $.isFunction(a)||$.isPlainObject(a)?a:{top:a,left:a}}var p=$.scrollTo=function(a,d,b){return $(window).scrollTo(a,d,b)};p.defaults={axis:"xy",duration:0,limit:!0};$.fn.scrollTo=function(a,d,b){"object"=== typeof d&&(b=d,d=0);"function"===typeof b&&(b={onAfter:b});"max"===a&&(a=9E9);b=$.extend({},p.defaults,b);d=d||b.duration;var u=b.queue&&1=f[g]?0:Math.min(f[g],n));!a&&1-1){targetElements.on(evt+EVENT_NAMESPACE,function elementToggle(event){$.powerTip.toggle(this,event)})}else{targetElements.on(evt+EVENT_NAMESPACE,function elementOpen(event){$.powerTip.show(this,event)})}});$.each(options.closeEvents,function(idx,evt){if($.inArray(evt,options.openEvents)<0){targetElements.on(evt+EVENT_NAMESPACE,function elementClose(event){$.powerTip.hide(this,!isMouseEvent(event))})}});targetElements.on("keydown"+EVENT_NAMESPACE,function elementKeyDown(event){if(event.keyCode===27){$.powerTip.hide(this,true)}})}return targetElements};$.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",popupClass:null,intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false,openEvents:["mouseenter","focus"],closeEvents:["mouseleave","blur"]};$.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};$.powerTip={show:function apiShowTip(element,event){if(isMouseEvent(event)){trackMouse(event);session.previousX=event.pageX;session.previousY=event.pageY;$(element).data(DATA_DISPLAYCONTROLLER).show()}else{$(element).first().data(DATA_DISPLAYCONTROLLER).show(true,true)}return element},reposition:function apiResetPosition(element){$(element).first().data(DATA_DISPLAYCONTROLLER).resetPosition();return element},hide:function apiCloseTip(element,immediate){var displayController;immediate=element?immediate:true;if(element){displayController=$(element).first().data(DATA_DISPLAYCONTROLLER)}else if(session.activeHover){displayController=session.activeHover.data(DATA_DISPLAYCONTROLLER)}if(displayController){displayController.hide(immediate)}return element},toggle:function apiToggle(element,event){if(session.activeHover&&session.activeHover.is(element)){$.powerTip.hide(element,!isMouseEvent(event))}else{$.powerTip.show(element,event)}return element}};$.powerTip.showTip=$.powerTip.show;$.powerTip.closeTip=$.powerTip.hide;function CSSCoordinates(){var me=this;me.top="auto";me.left="auto";me.right="auto";me.bottom="auto";me.set=function(property,value){if($.isNumeric(value)){me[property]=Math.round(value)}}}function DisplayController(element,options,tipController){var hoverTimer=null,myCloseDelay=null;function openTooltip(immediate,forceOpen){cancelTimer();if(!element.data(DATA_HASACTIVEHOVER)){if(!immediate){session.tipOpenImminent=true;hoverTimer=setTimeout(function intentDelay(){hoverTimer=null;checkForIntent()},options.intentPollInterval)}else{if(forceOpen){element.data(DATA_FORCEDOPEN,true)}closeAnyDelayed();tipController.showTip(element)}}else{cancelClose()}}function closeTooltip(disableDelay){if(myCloseDelay){myCloseDelay=session.closeDelayTimeout=clearTimeout(myCloseDelay);session.delayInProgress=false}cancelTimer();session.tipOpenImminent=false;if(element.data(DATA_HASACTIVEHOVER)){element.data(DATA_FORCEDOPEN,false);if(!disableDelay){session.delayInProgress=true;session.closeDelayTimeout=setTimeout(function closeDelay(){session.closeDelayTimeout=null;tipController.hideTip(element);session.delayInProgress=false;myCloseDelay=null},options.closeDelay);myCloseDelay=session.closeDelayTimeout}else{tipController.hideTip(element)}}}function checkForIntent(){var xDifference=Math.abs(session.previousX-session.currentX),yDifference=Math.abs(session.previousY-session.currentY),totalDifference=xDifference+yDifference;if(totalDifference",{id:options.popupId});if($body.length===0){$body=$("body")}$body.append(tipElement);session.tooltips=session.tooltips?session.tooltips.add(tipElement):tipElement}if(options.followMouse){if(!tipElement.data(DATA_HASMOUSEMOVE)){$document.on("mousemove"+EVENT_NAMESPACE,positionTipOnCursor);$window.on("scroll"+EVENT_NAMESPACE,positionTipOnCursor);tipElement.data(DATA_HASMOUSEMOVE,true)}}function beginShowTip(element){element.data(DATA_HASACTIVEHOVER,true);tipElement.queue(function queueTipInit(next){showTip(element);next()})}function showTip(element){var tipContent;if(!element.data(DATA_HASACTIVEHOVER)){return}if(session.isTipOpen){if(!session.isClosing){hideTip(session.activeHover)}tipElement.delay(100).queue(function queueTipAgain(next){showTip(element);next()});return}element.trigger("powerTipPreRender");tipContent=getTooltipContent(element);if(tipContent){tipElement.empty().append(tipContent)}else{return}element.trigger("powerTipRender");session.activeHover=element;session.isTipOpen=true;tipElement.data(DATA_MOUSEONTOTIP,options.mouseOnToPopup);tipElement.addClass(options.popupClass);if(!options.followMouse||element.data(DATA_FORCEDOPEN)){positionTipOnElement(element);session.isFixedTipOpen=true}else{positionTipOnCursor()}if(!element.data(DATA_FORCEDOPEN)&&!options.followMouse){$document.on("click"+EVENT_NAMESPACE,function documentClick(event){var target=event.target;if(target!==element[0]){if(options.mouseOnToPopup){if(target!==tipElement[0]&&!$.contains(tipElement[0],target)){$.powerTip.hide()}}else{$.powerTip.hide()}}})}if(options.mouseOnToPopup&&!options.manual){tipElement.on("mouseenter"+EVENT_NAMESPACE,function tipMouseEnter(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).cancel()}});tipElement.on("mouseleave"+EVENT_NAMESPACE,function tipMouseLeave(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide()}})}tipElement.fadeIn(options.fadeInTime,function fadeInCallback(){if(!session.desyncTimeout){session.desyncTimeout=setInterval(closeDesyncedTip,500)}element.trigger("powerTipOpen")})}function hideTip(element){session.isClosing=true;session.isTipOpen=false;session.desyncTimeout=clearInterval(session.desyncTimeout);element.data(DATA_HASACTIVEHOVER,false);element.data(DATA_FORCEDOPEN,false);$document.off("click"+EVENT_NAMESPACE);tipElement.off(EVENT_NAMESPACE);tipElement.fadeOut(options.fadeOutTime,function fadeOutCallback(){var coords=new CSSCoordinates;session.activeHover=null;session.isClosing=false;session.isFixedTipOpen=false;tipElement.removeClass();coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);tipElement.css(coords);element.trigger("powerTipClose")})}function positionTipOnCursor(){var tipWidth,tipHeight,coords,collisions,collisionCount;if(!session.isFixedTipOpen&&(session.isTipOpen||session.tipOpenImminent&&tipElement.data(DATA_HASMOUSEMOVE))){tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=new CSSCoordinates;coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);collisions=getViewportCollisions(coords,tipWidth,tipHeight);if(collisions!==Collision.none){collisionCount=countFlags(collisions);if(collisionCount===1){if(collisions===Collision.right){coords.set("left",session.scrollLeft+session.windowWidth-tipWidth)}else if(collisions===Collision.bottom){coords.set("top",session.scrollTop+session.windowHeight-tipHeight)}}else{coords.set("left",session.currentX-tipWidth-options.offset);coords.set("top",session.currentY-tipHeight-options.offset)}}tipElement.css(coords)}}function positionTipOnElement(element){var priorityList,finalPlacement;if(options.smartPlacement||options.followMouse&&element.data(DATA_FORCEDOPEN)){priorityList=$.fn.powerTip.smartPlacementLists[options.placement];$.each(priorityList,function(idx,pos){var collisions=getViewportCollisions(placeTooltip(element,pos),tipElement.outerWidth(),tipElement.outerHeight());finalPlacement=pos;return collisions!==Collision.none})}else{placeTooltip(element,options.placement);finalPlacement=options.placement}tipElement.removeClass("w nw sw e ne se n s w se-alt sw-alt ne-alt nw-alt");tipElement.addClass(finalPlacement)}function placeTooltip(element,placement){var iterationCount=0,tipWidth,tipHeight,coords=new CSSCoordinates;coords.set("top",0);coords.set("left",0);tipElement.css(coords);do{tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=placementCalculator.compute(element,placement,tipWidth,tipHeight,options.offset);tipElement.css(coords)}while(++iterationCount<=5&&(tipWidth!==tipElement.outerWidth()||tipHeight!==tipElement.outerHeight()));return coords}function closeDesyncedTip(){var isDesynced=false,hasDesyncableCloseEvent=$.grep(["mouseleave","mouseout","blur","focusout"],function(eventType){return $.inArray(eventType,options.closeEvents)!==-1}).length>0;if(session.isTipOpen&&!session.isClosing&&!session.delayInProgress&&hasDesyncableCloseEvent){if(session.activeHover.data(DATA_HASACTIVEHOVER)===false||session.activeHover.is(":disabled")){isDesynced=true}else if(!isMouseOver(session.activeHover)&&!session.activeHover.is(":focus")&&!session.activeHover.data(DATA_FORCEDOPEN)){if(tipElement.data(DATA_MOUSEONTOTIP)){if(!isMouseOver(tipElement)){isDesynced=true}}else{isDesynced=true}}if(isDesynced){hideTip(session.activeHover)}}}this.showTip=beginShowTip;this.hideTip=hideTip;this.resetPosition=positionTipOnElement}function isSvgElement(element){return Boolean(window.SVGElement&&element[0]instanceof SVGElement)}function isMouseEvent(event){return Boolean(event&&$.inArray(event.type,MOUSE_EVENTS)>-1&&typeof event.pageX==="number")}function initTracking(){if(!session.mouseTrackingActive){session.mouseTrackingActive=true;getViewportDimensions();$(getViewportDimensions);$document.on("mousemove"+EVENT_NAMESPACE,trackMouse);$window.on("resize"+EVENT_NAMESPACE,trackResize);$window.on("scroll"+EVENT_NAMESPACE,trackScroll)}}function getViewportDimensions(){session.scrollLeft=$window.scrollLeft();session.scrollTop=$window.scrollTop();session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackResize(){session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackScroll(){var x=$window.scrollLeft(),y=$window.scrollTop();if(x!==session.scrollLeft){session.currentX+=x-session.scrollLeft;session.scrollLeft=x}if(y!==session.scrollTop){session.currentY+=y-session.scrollTop;session.scrollTop=y}}function trackMouse(event){session.currentX=event.pageX;session.currentY=event.pageY}function isMouseOver(element){var elementPosition=element.offset(),elementBox=element[0].getBoundingClientRect(),elementWidth=elementBox.right-elementBox.left,elementHeight=elementBox.bottom-elementBox.top;return session.currentX>=elementPosition.left&&session.currentX<=elementPosition.left+elementWidth&&session.currentY>=elementPosition.top&&session.currentY<=elementPosition.top+elementHeight}function getTooltipContent(element){var tipText=element.data(DATA_POWERTIP),tipObject=element.data(DATA_POWERTIPJQ),tipTarget=element.data(DATA_POWERTIPTARGET),targetElement,content;if(tipText){if($.isFunction(tipText)){tipText=tipText.call(element[0])}content=tipText}else if(tipObject){if($.isFunction(tipObject)){tipObject=tipObject.call(element[0])}if(tipObject.length>0){content=tipObject.clone(true,true)}}else if(tipTarget){targetElement=$("#"+tipTarget);if(targetElement.length>0){content=targetElement.html()}}return content}function getViewportCollisions(coords,elementWidth,elementHeight){var viewportTop=session.scrollTop,viewportLeft=session.scrollLeft,viewportBottom=viewportTop+session.windowHeight,viewportRight=viewportLeft+session.windowWidth,collisions=Collision.none;if(coords.topviewportBottom||Math.abs(coords.bottom-session.windowHeight)>viewportBottom){collisions|=Collision.bottom}if(coords.leftviewportRight){collisions|=Collision.left}if(coords.left+elementWidth>viewportRight||coords.right1)){a.preventDefault();var c=a.originalEvent.changedTouches[0],d=document.createEvent("MouseEvents");d.initMouseEvent(b,!0,!0,window,1,c.screenX,c.screenY,c.clientX,c.clientY,!1,!1,!1,!1,0,null),a.target.dispatchEvent(d)}}if(a.support.touch="ontouchend"in document,a.support.touch){var e,b=a.ui.mouse.prototype,c=b._mouseInit,d=b._mouseDestroy;b._touchStart=function(a){var b=this;!e&&b._mouseCapture(a.originalEvent.changedTouches[0])&&(e=!0,b._touchMoved=!1,f(a,"mouseover"),f(a,"mousemove"),f(a,"mousedown"))},b._touchMove=function(a){e&&(this._touchMoved=!0,f(a,"mousemove"))},b._touchEnd=function(a){e&&(f(a,"mouseup"),f(a,"mouseout"),this._touchMoved||f(a,"click"),e=!1)},b._mouseInit=function(){var b=this;b.element.bind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),c.call(b)},b._mouseDestroy=function(){var b=this;b.element.unbind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),d.call(b)}}}(jQuery);/*! SmartMenus jQuery Plugin - v1.1.0 - September 17, 2017
+ * http://www.smartmenus.org/
+ * Copyright Vasil Dinkov, Vadikom Web Ltd. http://vadikom.com; Licensed MIT */(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):"object"==typeof module&&"object"==typeof module.exports?module.exports=t(require("jquery")):t(jQuery)})(function($){function initMouseDetection(t){var e=".smartmenus_mouse";if(mouseDetectionEnabled||t)mouseDetectionEnabled&&t&&($(document).off(e),mouseDetectionEnabled=!1);else{var i=!0,s=null,o={mousemove:function(t){var e={x:t.pageX,y:t.pageY,timeStamp:(new Date).getTime()};if(s){var o=Math.abs(s.x-e.x),a=Math.abs(s.y-e.y);if((o>0||a>0)&&2>=o&&2>=a&&300>=e.timeStamp-s.timeStamp&&(mouse=!0,i)){var n=$(t.target).closest("a");n.is("a")&&$.each(menuTrees,function(){return $.contains(this.$root[0],n[0])?(this.itemEnter({currentTarget:n[0]}),!1):void 0}),i=!1}}s=e}};o[touchEvents?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut"]=function(t){isTouchEvent(t.originalEvent)&&(mouse=!1)},$(document).on(getEventsNS(o,e)),mouseDetectionEnabled=!0}}function isTouchEvent(t){return!/^(4|mouse)$/.test(t.pointerType)}function getEventsNS(t,e){e||(e="");var i={};for(var s in t)i[s.split(" ").join(e+" ")+e]=t[s];return i}var menuTrees=[],mouse=!1,touchEvents="ontouchstart"in window,mouseDetectionEnabled=!1,requestAnimationFrame=window.requestAnimationFrame||function(t){return setTimeout(t,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||function(t){clearTimeout(t)},canAnimate=!!$.fn.animate;return $.SmartMenus=function(t,e){this.$root=$(t),this.opts=e,this.rootId="",this.accessIdPrefix="",this.$subArrow=null,this.activatedItems=[],this.visibleSubMenus=[],this.showTimeout=0,this.hideTimeout=0,this.scrollTimeout=0,this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.idInc=0,this.$firstLink=null,this.$firstSub=null,this.disabled=!1,this.$disableOverlay=null,this.$touchScrollingSub=null,this.cssTransforms3d="perspective"in t.style||"webkitPerspective"in t.style,this.wasCollapsible=!1,this.init()},$.extend($.SmartMenus,{hideAll:function(){$.each(menuTrees,function(){this.menuHideAll()})},destroy:function(){for(;menuTrees.length;)menuTrees[0].destroy();initMouseDetection(!0)},prototype:{init:function(t){var e=this;if(!t){menuTrees.push(this),this.rootId=((new Date).getTime()+Math.random()+"").replace(/\D/g,""),this.accessIdPrefix="sm-"+this.rootId+"-",this.$root.hasClass("sm-rtl")&&(this.opts.rightToLeftSubMenus=!0);var i=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).on(getEventsNS({"mouseover focusin":$.proxy(this.rootOver,this),"mouseout focusout":$.proxy(this.rootOut,this),keydown:$.proxy(this.rootKeyDown,this)},i)).on(getEventsNS({mouseenter:$.proxy(this.itemEnter,this),mouseleave:$.proxy(this.itemLeave,this),mousedown:$.proxy(this.itemDown,this),focus:$.proxy(this.itemFocus,this),blur:$.proxy(this.itemBlur,this),click:$.proxy(this.itemClick,this)},i),"a"),i+=this.rootId,this.opts.hideOnClick&&$(document).on(getEventsNS({touchstart:$.proxy(this.docTouchStart,this),touchmove:$.proxy(this.docTouchMove,this),touchend:$.proxy(this.docTouchEnd,this),click:$.proxy(this.docClick,this)},i)),$(window).on(getEventsNS({"resize orientationchange":$.proxy(this.winResize,this)},i)),this.opts.subIndicators&&(this.$subArrow=$("
').css({position:"absolute",top:e.top,left:e.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(!0),opacity:0}).appendTo(document.body)}this.disabled=!0}},docClick:function(t){return this.$touchScrollingSub?(this.$touchScrollingSub=null,void 0):((this.visibleSubMenus.length&&!$.contains(this.$root[0],t.target)||$(t.target).closest("a").length)&&this.menuHideAll(),void 0)},docTouchEnd:function(){if(this.lastTouch){if(!(!this.visibleSubMenus.length||void 0!==this.lastTouch.x2&&this.lastTouch.x1!=this.lastTouch.x2||void 0!==this.lastTouch.y2&&this.lastTouch.y1!=this.lastTouch.y2||this.lastTouch.target&&$.contains(this.$root[0],this.lastTouch.target))){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var t=this;this.hideTimeout=setTimeout(function(){t.menuHideAll()},350)}this.lastTouch=null}},docTouchMove:function(t){if(this.lastTouch){var e=t.originalEvent.touches[0];this.lastTouch.x2=e.pageX,this.lastTouch.y2=e.pageY}},docTouchStart:function(t){var e=t.originalEvent.touches[0];this.lastTouch={x1:e.pageX,y1:e.pageY,target:e.target}},enable:function(){this.disabled&&(this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),this.disabled=!1)},getClosestMenu:function(t){for(var e=$(t).closest("ul");e.dataSM("in-mega");)e=e.parent().closest("ul");return e[0]||null},getHeight:function(t){return this.getOffset(t,!0)},getOffset:function(t,e){var i;"none"==t.css("display")&&(i={position:t[0].style.position,visibility:t[0].style.visibility},t.css({position:"absolute",visibility:"hidden"}).show());var s=t[0].getBoundingClientRect&&t[0].getBoundingClientRect(),o=s&&(e?s.height||s.bottom-s.top:s.width||s.right-s.left);return o||0===o||(o=e?t[0].offsetHeight:t[0].offsetWidth),i&&t.hide().css(i),o},getStartZIndex:function(t){var e=parseInt(this[t?"$root":"$firstSub"].css("z-index"));return!t&&isNaN(e)&&(e=parseInt(this.$root.css("z-index"))),isNaN(e)?1:e},getTouchPoint:function(t){return t.touches&&t.touches[0]||t.changedTouches&&t.changedTouches[0]||t},getViewport:function(t){var e=t?"Height":"Width",i=document.documentElement["client"+e],s=window["inner"+e];return s&&(i=Math.min(i,s)),i},getViewportHeight:function(){return this.getViewport(!0)},getViewportWidth:function(){return this.getViewport()},getWidth:function(t){return this.getOffset(t)},handleEvents:function(){return!this.disabled&&this.isCSSOn()},handleItemEvents:function(t){return this.handleEvents()&&!this.isLinkInMegaMenu(t)},isCollapsible:function(){return"static"==this.$firstSub.css("position")},isCSSOn:function(){return"inline"!=this.$firstLink.css("display")},isFixed:function(){var t="fixed"==this.$root.css("position");return t||this.$root.parentsUntil("body").each(function(){return"fixed"==$(this).css("position")?(t=!0,!1):void 0}),t},isLinkInMegaMenu:function(t){return $(this.getClosestMenu(t[0])).hasClass("mega-menu")},isTouchMode:function(){return!mouse||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(t,e){var i=t.closest("ul"),s=i.dataSM("level");if(s>1&&(!this.activatedItems[s-2]||this.activatedItems[s-2][0]!=i.dataSM("parent-a")[0])){var o=this;$(i.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(i).each(function(){o.itemActivate($(this).dataSM("parent-a"))})}if((!this.isCollapsible()||e)&&this.menuHideSubMenus(this.activatedItems[s-1]&&this.activatedItems[s-1][0]==t[0]?s:s-1),this.activatedItems[s-1]=t,this.$root.triggerHandler("activate.smapi",t[0])!==!1){var a=t.dataSM("sub");a&&(this.isTouchMode()||!this.opts.showOnClick||this.clickActivated)&&this.menuShow(a)}},itemBlur:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&this.$root.triggerHandler("blur.smapi",e[0])},itemClick:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==e.closest("ul")[0])return this.$touchScrollingSub=null,t.stopPropagation(),!1;if(this.$root.triggerHandler("click.smapi",e[0])===!1)return!1;var i=$(t.target).is(".sub-arrow"),s=e.dataSM("sub"),o=s?2==s.dataSM("level"):!1,a=this.isCollapsible(),n=/toggle$/.test(this.opts.collapsibleBehavior),r=/link$/.test(this.opts.collapsibleBehavior),h=/^accordion/.test(this.opts.collapsibleBehavior);if(s&&!s.is(":visible")){if((!r||!a||i)&&(this.opts.showOnClick&&o&&(this.clickActivated=!0),this.itemActivate(e,h),s.is(":visible")))return this.focusActivated=!0,!1}else if(a&&(n||i))return this.itemActivate(e,h),this.menuHide(s),n&&(this.focusActivated=!1),!1;return this.opts.showOnClick&&o||e.hasClass("disabled")||this.$root.triggerHandler("select.smapi",e[0])===!1?!1:void 0}},itemDown:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&e.dataSM("mousedown",!0)},itemEnter:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(!this.isTouchMode()){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);var i=this;this.showTimeout=setTimeout(function(){i.itemActivate(e)},this.opts.showOnClick&&1==e.closest("ul").dataSM("level")?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",e[0])}},itemFocus:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(!this.focusActivated||this.isTouchMode()&&e.dataSM("mousedown")||this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0]==e[0]||this.itemActivate(e,!0),this.$root.triggerHandler("focus.smapi",e[0]))},itemLeave:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(this.isTouchMode()||(e[0].blur(),this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0)),e.removeDataSM("mousedown"),this.$root.triggerHandler("mouseleave.smapi",e[0]))},menuHide:function(t){if(this.$root.triggerHandler("beforehide.smapi",t[0])!==!1&&(canAnimate&&t.stop(!0,!0),"none"!=t.css("display"))){var e=function(){t.css("z-index","")};this.isCollapsible()?canAnimate&&this.opts.collapsibleHideFunction?this.opts.collapsibleHideFunction.call(this,t,e):t.hide(this.opts.collapsibleHideDuration,e):canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,t,e):t.hide(this.opts.hideDuration,e),t.dataSM("scroll")&&(this.menuScrollStop(t),t.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).off(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()),t.dataSM("parent-a").removeClass("highlighted").attr("aria-expanded","false"),t.attr({"aria-expanded":"false","aria-hidden":"true"});var i=t.dataSM("level");this.activatedItems.splice(i-1,1),this.visibleSubMenus.splice($.inArray(t,this.visibleSubMenus),1),this.$root.triggerHandler("hide.smapi",t[0])}},menuHideAll:function(){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);for(var t=this.opts.isPopup?1:0,e=this.visibleSubMenus.length-1;e>=t;e--)this.menuHide(this.visibleSubMenus[e]);this.opts.isPopup&&(canAnimate&&this.$root.stop(!0,!0),this.$root.is(":visible")&&(canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,this.$root):this.$root.hide(this.opts.hideDuration))),this.activatedItems=[],this.visibleSubMenus=[],this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(t){for(var e=this.activatedItems.length-1;e>=t;e--){var i=this.activatedItems[e].dataSM("sub");i&&this.menuHide(i)}},menuInit:function(t){if(!t.dataSM("in-mega")){t.hasClass("mega-menu")&&t.find("ul").dataSM("in-mega",!0);for(var e=2,i=t[0];(i=i.parentNode.parentNode)!=this.$root[0];)e++;var s=t.prevAll("a").eq(-1);s.length||(s=t.prevAll().find("a").eq(-1)),s.addClass("has-submenu").dataSM("sub",t),t.dataSM("parent-a",s).dataSM("level",e).parent().dataSM("sub",t);var o=s.attr("id")||this.accessIdPrefix+ ++this.idInc,a=t.attr("id")||this.accessIdPrefix+ ++this.idInc;s.attr({id:o,"aria-haspopup":"true","aria-controls":a,"aria-expanded":"false"}),t.attr({id:a,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"}),this.opts.subIndicators&&s[this.opts.subIndicatorsPos](this.$subArrow.clone())}},menuPosition:function(t){var e,i,s=t.dataSM("parent-a"),o=s.closest("li"),a=o.parent(),n=t.dataSM("level"),r=this.getWidth(t),h=this.getHeight(t),u=s.offset(),l=u.left,c=u.top,d=this.getWidth(s),m=this.getHeight(s),p=$(window),f=p.scrollLeft(),v=p.scrollTop(),b=this.getViewportWidth(),S=this.getViewportHeight(),g=a.parent().is("[data-sm-horizontal-sub]")||2==n&&!a.hasClass("sm-vertical"),M=this.opts.rightToLeftSubMenus&&!o.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&o.is("[data-sm-reverse]"),w=2==n?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,T=2==n?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY;if(g?(e=M?d-r-w:w,i=this.opts.bottomToTopSubMenus?-h-T:m+T):(e=M?w-r:d-w,i=this.opts.bottomToTopSubMenus?m-T-h:T),this.opts.keepInViewport){var y=l+e,I=c+i;if(M&&f>y?e=g?f-y+e:d-w:!M&&y+r>f+b&&(e=g?f+b-r-y+e:w-r),g||(S>h&&I+h>v+S?i+=v+S-h-I:(h>=S||v>I)&&(i+=v-I)),g&&(I+h>v+S+.49||v>I)||!g&&h>S+.49){var x=this;t.dataSM("scroll-arrows")||t.dataSM("scroll-arrows",$([$('0;t.dataSM("scroll-arrows").eq(i?0:1).is(":visible")&&(t.dataSM("scroll").up=i,this.menuScroll(t,!0))}e.preventDefault()},menuScrollOut:function(t,e){mouse&&(/^scroll-(up|down)/.test((e.relatedTarget||"").className)||(t[0]==e.relatedTarget||$.contains(t[0],e.relatedTarget))&&this.getClosestMenu(e.relatedTarget)==t[0]||t.dataSM("scroll-arrows").css("visibility","hidden"))},menuScrollOver:function(t,e){if(mouse&&!/^scroll-(up|down)/.test(e.target.className)&&this.getClosestMenu(e.target)==t[0]){this.menuScrollRefreshData(t);var i=t.dataSM("scroll"),s=$(window).scrollTop()-t.dataSM("parent-a").offset().top-i.itemH;t.dataSM("scroll-arrows").eq(0).css("margin-top",s).end().eq(1).css("margin-top",s+this.getViewportHeight()-i.arrowDownH).end().css("visibility","visible")}},menuScrollRefreshData:function(t){var e=t.dataSM("scroll"),i=$(window).scrollTop()-t.dataSM("parent-a").offset().top-e.itemH;this.cssTransforms3d&&(i=-(parseFloat(t.css("margin-top"))-i)),$.extend(e,{upEnd:i,downEnd:i+this.getViewportHeight()-e.subH})},menuScrollStop:function(t){return this.scrollTimeout?(cancelAnimationFrame(this.scrollTimeout),this.scrollTimeout=0,t.dataSM("scroll").step=1,!0):void 0},menuScrollTouch:function(t,e){if(e=e.originalEvent,isTouchEvent(e)){var i=this.getTouchPoint(e);if(this.getClosestMenu(i.target)==t[0]){var s=t.dataSM("scroll");if(/(start|down)$/i.test(e.type))this.menuScrollStop(t)?(e.preventDefault(),this.$touchScrollingSub=t):this.$touchScrollingSub=null,this.menuScrollRefreshData(t),$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp});else if(/move$/i.test(e.type)){var o=void 0!==s.touchY?s.touchY:s.touchStartY;if(void 0!==o&&o!=i.pageY){this.$touchScrollingSub=t;var a=i.pageY>o;void 0!==s.up&&s.up!=a&&$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp}),$.extend(s,{up:a,touchY:i.pageY}),this.menuScroll(t,!0,Math.abs(i.pageY-o))}e.preventDefault()}else void 0!==s.touchY&&((s.momentum=15*Math.pow(Math.abs(i.pageY-s.touchStartY)/(e.timeStamp-s.touchStartTime),2))&&(this.menuScrollStop(t),this.menuScroll(t),e.preventDefault()),delete s.touchY)}}},menuShow:function(t){if((t.dataSM("beforefirstshowfired")||(t.dataSM("beforefirstshowfired",!0),this.$root.triggerHandler("beforefirstshow.smapi",t[0])!==!1))&&this.$root.triggerHandler("beforeshow.smapi",t[0])!==!1&&(t.dataSM("shown-before",!0),canAnimate&&t.stop(!0,!0),!t.is(":visible"))){var e=t.dataSM("parent-a"),i=this.isCollapsible();if((this.opts.keepHighlighted||i)&&e.addClass("highlighted"),i)t.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""});else{if(t.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1),(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth)&&(t.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap"),this.opts.subMenusMinWidth&&t.css("min-width",this.opts.subMenusMinWidth),this.opts.subMenusMaxWidth)){var s=this.getWidth(t);t.css("max-width",this.opts.subMenusMaxWidth),s>this.getWidth(t)&&t.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}this.menuPosition(t)}var o=function(){t.css("overflow","")};i?canAnimate&&this.opts.collapsibleShowFunction?this.opts.collapsibleShowFunction.call(this,t,o):t.show(this.opts.collapsibleShowDuration,o):canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,t,o):t.show(this.opts.showDuration,o),e.attr("aria-expanded","true"),t.attr({"aria-expanded":"true","aria-hidden":"false"}),this.visibleSubMenus.push(t),this.$root.triggerHandler("show.smapi",t[0])}},popupHide:function(t){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},t?1:this.opts.hideTimeout)},popupShow:function(t,e){if(!this.opts.isPopup)return alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.'),void 0;if(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),this.$root.dataSM("shown-before",!0),canAnimate&&this.$root.stop(!0,!0),!this.$root.is(":visible")){this.$root.css({left:t,top:e});var i=this,s=function(){i.$root.css("overflow","")};canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,this.$root,s):this.$root.show(this.opts.showDuration,s),this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(!0),this.init(!0)},rootKeyDown:function(t){if(this.handleEvents())switch(t.keyCode){case 27:var e=this.activatedItems[0];if(e){this.menuHideAll(),e[0].focus();var i=e.dataSM("sub");i&&this.menuHide(i)}break;case 32:var s=$(t.target);if(s.is("a")&&this.handleItemEvents(s)){var i=s.dataSM("sub");i&&!i.is(":visible")&&(this.itemClick({currentTarget:t.target}),t.preventDefault())}}},rootOut:function(t){if(this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),!this.opts.showOnClick||!this.opts.hideOnClick)){var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},this.opts.hideTimeout)}},rootOver:function(t){this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0)},winResize:function(t){if(this.handleEvents()){if(!("onorientationchange"in window)||"orientationchange"==t.type){var e=this.isCollapsible();this.wasCollapsible&&e||(this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0].blur(),this.menuHideAll()),this.wasCollapsible=e}}else if(this.$disableOverlay){var i=this.$root.offset();this.$disableOverlay.css({top:i.top,left:i.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}}}}),$.fn.dataSM=function(t,e){return e?this.data(t+"_smartmenus",e):this.data(t+"_smartmenus")},$.fn.removeDataSM=function(t){return this.removeData(t+"_smartmenus")},$.fn.smartmenus=function(options){if("string"==typeof options){var args=arguments,method=options;return Array.prototype.shift.call(args),this.each(function(){var t=$(this).data("smartmenus");t&&t[method]&&t[method].apply(t,args)})}return this.each(function(){var dataOpts=$(this).data("sm-options")||null;if(dataOpts)try{dataOpts=eval("("+dataOpts+")")}catch(e){dataOpts=null,alert('ERROR\n\nSmartMenus jQuery init:\nInvalid "data-sm-options" attribute value syntax.')}new $.SmartMenus(this,$.extend({},$.fn.smartmenus.defaults,options,dataOpts))})},$.fn.smartmenus.defaults={isPopup:!1,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:!0,subIndicatorsPos:"append",subIndicatorsText:"",scrollStep:30,scrollAccelerate:!0,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(t,e){t.fadeOut(200,e)},collapsibleShowDuration:0,collapsibleShowFunction:function(t,e){t.slideDown(200,e)},collapsibleHideDuration:0,collapsibleHideFunction:function(t,e){t.slideUp(200,e)},showOnClick:!1,hideOnClick:!0,noMouseOver:!1,keepInViewport:!0,keepHighlighted:!0,markCurrentItem:!1,markCurrentTree:!0,rightToLeftSubMenus:!1,bottomToTopSubMenus:!1,collapsibleBehavior:"default"},$});
\ No newline at end of file
diff --git a/menu.js b/menu.js
new file mode 100644
index 000000000..d18a2fe2a
--- /dev/null
+++ b/menu.js
@@ -0,0 +1,51 @@
+/*
+ @licstart The following is the entire license notice for the JavaScript code in this file.
+
+ The MIT License (MIT)
+
+ Copyright (C) 1997-2020 by Dimitri van Heesch
+
+ 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.
+
+ @licend The above is the entire license notice for the JavaScript code in this file
+ */
+function initMenu(relPath,searchEnabled,serverSide,searchPage,search) {
+ function makeTree(data,relPath) {
+ var result='';
+ if ('children' in data) {
+ result+='';
+ }
+ return result;
+ }
+
+ $('#main-nav').append(makeTree(menudata,relPath));
+ $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu');
+ if (searchEnabled) {
+ if (serverSide) {
+ $('#main-menu').append('Algorithms_in_C++: Modules
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all modules:
+
+
Algorithms_in_C++: Namespace Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented namespace members with links to the namespaces they belong to:
+
+
Algorithms_in_C++: Namespace Members
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
Algorithms_in_C++: Namespace List
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all documented namespaces with brief descriptions:
+
+
1) hash = '#'+parts[1].replace(/[^\w\-]/g,'');
+ else hash='';
+ }
+ if (hash.match(/^#l\d+$/)) {
+ var anchor=$('a[name='+hash.substring(1)+']');
+ glowEffect(anchor.parent(),1000); // line number
+ hash=''; // strip line number anchors
+ }
+ var url=root+hash;
+ var i=-1;
+ while (NAVTREEINDEX[i+1]<=url) i++;
+ if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index
+ if (navTreeSubIndices[i]) {
+ gotoNode(o,i,root,hash,relpath)
+ } else {
+ getScript(relpath+'navtreeindex'+i,function(){
+ navTreeSubIndices[i] = eval('NAVTREEINDEX'+i);
+ if (navTreeSubIndices[i]) {
+ gotoNode(o,i,root,hash,relpath);
+ }
+ },true);
+ }
+}
+
+function showSyncOff(n,relpath)
+{
+ n.html('Algorithms_in_C++: Related Pages
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Here is a list of all related documentation pages:
+
+
=desktop_vp) {
+ if (!collapsed) {
+ collapseExpand();
+ }
+ } else if (width>desktop_vp && collapsedWidth0) {
+ restoreWidth(0);
+ collapsed=true;
+ }
+ else {
+ var width = readCookie('width');
+ if (width>200 && width<$(window).width()) { restoreWidth(width); } else { restoreWidth(200); }
+ collapsed=false;
+ }
+ }
+
+ header = $("#top");
+ sidenav = $("#side-nav");
+ content = $("#doc-content");
+ navtree = $("#nav-tree");
+ footer = $("#nav-path");
+ $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(); } });
+ $(sidenav).resizable({ minWidth: 0 });
+ $(window).resize(function() { resizeHeight(); });
+ var device = navigator.userAgent.toLowerCase();
+ var touch_device = device.match(/(iphone|ipod|ipad|android)/);
+ if (touch_device) { /* wider split bar for touch only devices */
+ $(sidenav).css({ paddingRight:'20px' });
+ $('.ui-resizable-e').css({ width:'20px' });
+ $('#nav-sync').css({ right:'34px' });
+ barWidth=20;
+ }
+ var width = readCookie('width');
+ if (width) { restoreWidth(width); } else { resizeWidth(); }
+ resizeHeight();
+ var url = location.href;
+ var i=url.indexOf("#");
+ if (i>=0) window.location.hash=url.substr(i);
+ var _preventDefault = function(evt) { evt.preventDefault(); };
+ $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault);
+ $(".ui-resizable-handle").dblclick(collapseExpand);
+ $(window).on('load',resizeHeight);
+}
+/* @license-end */
diff --git a/search/all_0.html b/search/all_0.html
new file mode 100644
index 000000000..ea50fff7e
--- /dev/null
+++ b/search/all_0.html
@@ -0,0 +1,36 @@
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
do a search
+ {
+ this.Search();
+ }
+ }
+
+ this.OnSearchSelectKey = function(evt)
+ {
+ var e = (evt) ? evt : window.event; // for IE
+ if (e.keyCode==40 && this.searchIndex0) // Up
+ {
+ this.searchIndex--;
+ this.OnSelectItem(this.searchIndex);
+ }
+ else if (e.keyCode==13 || e.keyCode==27)
+ {
+ this.OnSelectItem(this.searchIndex);
+ this.CloseSelectionWindow();
+ this.DOMSearchField().focus();
+ }
+ return false;
+ }
+
+ // --------- Actions
+
+ // Closes the results window.
+ this.CloseResultsWindow = function()
+ {
+ this.DOMPopupSearchResultsWindow().style.display = 'none';
+ this.DOMSearchClose().style.display = 'none';
+ this.Activate(false);
+ }
+
+ this.CloseSelectionWindow = function()
+ {
+ this.DOMSearchSelectWindow().style.display = 'none';
+ }
+
+ // Performs a search.
+ this.Search = function()
+ {
+ this.keyTimeout = 0;
+
+ // strip leading whitespace
+ var searchValue = this.DOMSearchField().value.replace(/^ +/, "");
+
+ var code = searchValue.toLowerCase().charCodeAt(0);
+ var idxChar = searchValue.substr(0, 1).toLowerCase();
+ if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair
+ {
+ idxChar = searchValue.substr(0, 2);
+ }
+
+ var resultsPage;
+ var resultsPageWithSearch;
+ var hasResultsPage;
+
+ var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar);
+ if (idx!=-1)
+ {
+ var hexCode=idx.toString(16);
+ resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html';
+ resultsPageWithSearch = resultsPage+'?'+escape(searchValue);
+ hasResultsPage = true;
+ }
+ else // nothing available for this search term
+ {
+ resultsPage = this.resultsPath + '/nomatches.html';
+ resultsPageWithSearch = resultsPage;
+ hasResultsPage = false;
+ }
+
+ window.frames.MSearchResults.location = resultsPageWithSearch;
+ var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow();
+
+ if (domPopupSearchResultsWindow.style.display!='block')
+ {
+ var domSearchBox = this.DOMSearchBox();
+ this.DOMSearchClose().style.display = 'inline';
+ if (this.insideFrame)
+ {
+ var domPopupSearchResults = this.DOMPopupSearchResults();
+ domPopupSearchResultsWindow.style.position = 'relative';
+ domPopupSearchResultsWindow.style.display = 'block';
+ var width = document.body.clientWidth - 8; // the -8 is for IE :-(
+ domPopupSearchResultsWindow.style.width = width + 'px';
+ domPopupSearchResults.style.width = width + 'px';
+ }
+ else
+ {
+ var domPopupSearchResults = this.DOMPopupSearchResults();
+ var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth;
+ var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1;
+ domPopupSearchResultsWindow.style.display = 'block';
+ left -= domPopupSearchResults.offsetWidth;
+ domPopupSearchResultsWindow.style.top = top + 'px';
+ domPopupSearchResultsWindow.style.left = left + 'px';
+ }
+ }
+
+ this.lastSearchValue = searchValue;
+ this.lastResultsPage = resultsPage;
+ }
+
+ // -------- Activation Functions
+
+ // Activates or deactivates the search panel, resetting things to
+ // their default values if necessary.
+ this.Activate = function(isActive)
+ {
+ if (isActive || // open it
+ this.DOMPopupSearchResultsWindow().style.display == 'block'
+ )
+ {
+ this.DOMSearchBox().className = 'MSearchBoxActive';
+
+ var searchField = this.DOMSearchField();
+
+ if (searchField.value == this.searchLabel) // clear "Search" term upon entry
+ {
+ searchField.value = '';
+ this.searchActive = true;
+ }
+ }
+ else if (!isActive) // directly remove the panel
+ {
+ this.DOMSearchBox().className = 'MSearchBoxInactive';
+ this.DOMSearchField().value = this.searchLabel;
+ this.searchActive = false;
+ this.lastSearchValue = ''
+ this.lastResultsPage = '';
+ }
+ }
+}
+
+// -----------------------------------------------------------------------
+
+// The class that handles everything on the search results page.
+function SearchResults(name)
+{
+ // The number of matches from the last run of .
+ this.lastMatchCount = 0;
+ this.lastKey = 0;
+ this.repeatOn = false;
+
+ // Toggles the visibility of the passed element ID.
+ this.FindChildElement = function(id)
+ {
+ var parentElement = document.getElementById(id);
+ var element = parentElement.firstChild;
+
+ while (element && element!=parentElement)
+ {
+ if (element.nodeName == 'DIV' && element.className == 'SRChildren')
+ {
+ return element;
+ }
+
+ if (element.nodeName == 'DIV' && element.hasChildNodes())
+ {
+ element = element.firstChild;
+ }
+ else if (element.nextSibling)
+ {
+ element = element.nextSibling;
+ }
+ else
+ {
+ do
+ {
+ element = element.parentNode;
+ }
+ while (element && element!=parentElement && !element.nextSibling);
+
+ if (element && element!=parentElement)
+ {
+ element = element.nextSibling;
+ }
+ }
+ }
+ }
+
+ this.Toggle = function(id)
+ {
+ var element = this.FindChildElement(id);
+ if (element)
+ {
+ if (element.style.display == 'block')
+ {
+ element.style.display = 'none';
+ }
+ else
+ {
+ element.style.display = 'block';
+ }
+ }
+ }
+
+ // Searches for the passed string. If there is no parameter,
+ // it takes it from the URL query.
+ //
+ // Always returns true, since other documents may try to call it
+ // and that may or may not be possible.
+ this.Search = function(search)
+ {
+ if (!search) // get search word from URL
+ {
+ search = window.location.search;
+ search = search.substring(1); // Remove the leading '?'
+ search = unescape(search);
+ }
+
+ search = search.replace(/^ +/, ""); // strip leading spaces
+ search = search.replace(/ +$/, ""); // strip trailing spaces
+ search = search.toLowerCase();
+ search = convertToId(search);
+
+ var resultRows = document.getElementsByTagName("div");
+ var matches = 0;
+
+ var i = 0;
+ while (i < resultRows.length)
+ {
+ var row = resultRows.item(i);
+ if (row.className == "SRResult")
+ {
+ var rowMatchName = row.id.toLowerCase();
+ rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_'
+
+ if (search.length<=rowMatchName.length &&
+ rowMatchName.substr(0, search.length)==search)
+ {
+ row.style.display = 'block';
+ matches++;
+ }
+ else
+ {
+ row.style.display = 'none';
+ }
+ }
+ i++;
+ }
+ document.getElementById("Searching").style.display='none';
+ if (matches == 0) // no results
+ {
+ document.getElementById("NoMatches").style.display='block';
+ }
+ else // at least one result
+ {
+ document.getElementById("NoMatches").style.display='none';
+ }
+ this.lastMatchCount = matches;
+ return true;
+ }
+
+ // return the first item with index index or higher that is visible
+ this.NavNext = function(index)
+ {
+ var focusItem;
+ while (1)
+ {
+ var focusName = 'Item'+index;
+ focusItem = document.getElementById(focusName);
+ if (focusItem && focusItem.parentNode.parentNode.style.display=='block')
+ {
+ break;
+ }
+ else if (!focusItem) // last element
+ {
+ break;
+ }
+ focusItem=null;
+ index++;
+ }
+ return focusItem;
+ }
+
+ this.NavPrev = function(index)
+ {
+ var focusItem;
+ while (1)
+ {
+ var focusName = 'Item'+index;
+ focusItem = document.getElementById(focusName);
+ if (focusItem && focusItem.parentNode.parentNode.style.display=='block')
+ {
+ break;
+ }
+ else if (!focusItem) // last element
+ {
+ break;
+ }
+ focusItem=null;
+ index--;
+ }
+ return focusItem;
+ }
+
+ this.ProcessKeys = function(e)
+ {
+ if (e.type == "keydown")
+ {
+ this.repeatOn = false;
+ this.lastKey = e.keyCode;
+ }
+ else if (e.type == "keypress")
+ {
+ if (!this.repeatOn)
+ {
+ if (this.lastKey) this.repeatOn = true;
+ return false; // ignore first keypress after keydown
+ }
+ }
+ else if (e.type == "keyup")
+ {
+ this.lastKey = 0;
+ this.repeatOn = false;
+ }
+ return this.lastKey!=0;
+ }
+
+ this.Nav = function(evt,itemIndex)
+ {
+ var e = (evt) ? evt : window.event; // for IE
+ if (e.keyCode==13) return true;
+ if (!this.ProcessKeys(e)) return false;
+
+ if (this.lastKey==38) // Up
+ {
+ var newIndex = itemIndex-1;
+ var focusItem = this.NavPrev(newIndex);
+ if (focusItem)
+ {
+ var child = this.FindChildElement(focusItem.parentNode.parentNode.id);
+ if (child && child.style.display == 'block') // children visible
+ {
+ var n=0;
+ var tmpElem;
+ while (1) // search for last child
+ {
+ tmpElem = document.getElementById('Item'+newIndex+'_c'+n);
+ if (tmpElem)
+ {
+ focusItem = tmpElem;
+ }
+ else // found it!
+ {
+ break;
+ }
+ n++;
+ }
+ }
+ }
+ if (focusItem)
+ {
+ focusItem.focus();
+ }
+ else // return focus to search field
+ {
+ parent.document.getElementById("MSearchField").focus();
+ }
+ }
+ else if (this.lastKey==40) // Down
+ {
+ var newIndex = itemIndex+1;
+ var focusItem;
+ var item = document.getElementById('Item'+itemIndex);
+ var elem = this.FindChildElement(item.parentNode.parentNode.id);
+ if (elem && elem.style.display == 'block') // children visible
+ {
+ focusItem = document.getElementById('Item'+itemIndex+'_c0');
+ }
+ if (!focusItem) focusItem = this.NavNext(newIndex);
+ if (focusItem) focusItem.focus();
+ }
+ else if (this.lastKey==39) // Right
+ {
+ var item = document.getElementById('Item'+itemIndex);
+ var elem = this.FindChildElement(item.parentNode.parentNode.id);
+ if (elem) elem.style.display = 'block';
+ }
+ else if (this.lastKey==37) // Left
+ {
+ var item = document.getElementById('Item'+itemIndex);
+ var elem = this.FindChildElement(item.parentNode.parentNode.id);
+ if (elem) elem.style.display = 'none';
+ }
+ else if (this.lastKey==27) // Escape
+ {
+ parent.searchBox.CloseResultsWindow();
+ parent.document.getElementById("MSearchField").focus();
+ }
+ else if (this.lastKey==13) // Enter
+ {
+ return true;
+ }
+ return false;
+ }
+
+ this.NavChild = function(evt,itemIndex,childIndex)
+ {
+ var e = (evt) ? evt : window.event; // for IE
+ if (e.keyCode==13) return true;
+ if (!this.ProcessKeys(e)) return false;
+
+ if (this.lastKey==38) // Up
+ {
+ if (childIndex>0)
+ {
+ var newIndex = childIndex-1;
+ document.getElementById('Item'+itemIndex+'_c'+newIndex).focus();
+ }
+ else // already at first child, jump to parent
+ {
+ document.getElementById('Item'+itemIndex).focus();
+ }
+ }
+ else if (this.lastKey==40) // Down
+ {
+ var newIndex = childIndex+1;
+ var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex);
+ if (!elem) // last child, jump to parent next parent
+ {
+ elem = this.NavNext(itemIndex+1);
+ }
+ if (elem)
+ {
+ elem.focus();
+ }
+ }
+ else if (this.lastKey==27) // Escape
+ {
+ parent.searchBox.CloseResultsWindow();
+ parent.document.getElementById("MSearchField").focus();
+ }
+ else if (this.lastKey==13) // Enter
+ {
+ return true;
+ }
+ return false;
+ }
+}
+
+function setKeyActions(elem,action)
+{
+ elem.setAttribute('onkeydown',action);
+ elem.setAttribute('onkeypress',action);
+ elem.setAttribute('onkeyup',action);
+}
+
+function setClassAttr(elem,attr)
+{
+ elem.setAttribute('class',attr);
+ elem.setAttribute('className',attr);
+}
+
+function createResults()
+{
+ var results = document.getElementById("SRResults");
+ for (var e=0; e
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
+
Loading...
+
+
+
Searching...
+
No Matches
+
+
. All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without modification, are
+ permitted provided that the following conditions are met:
+
+ 1. Redistributions of source code must retain the above copyright notice, this list of
+ conditions and the following disclaimer.
+
+ 2. Redistributions in binary form must reproduce the above copyright notice, this list
+ of conditions and the following disclaimer in the documentation and/or other materials
+ provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY Andrea Leofreddi ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Andrea Leofreddi OR
+ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+ The views and conclusions contained in the software and documentation are those of the
+ authors and should not be interpreted as representing official policies, either expressed
+ or implied, of Andrea Leofreddi.
+
+ @licend The above is the entire license notice for the JavaScript code in this file
+ */
+
+var root = document.documentElement;
+var state = 'none';
+var stateOrigin;
+var stateTf = root.createSVGMatrix();
+var cursorGrab = ' url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAA4AAAAOCAMAAAAolt3jAAAAGXRFWHRTb2Z0d2FyZQBBZG9iZSBJbWFnZVJlYWR5ccllPAAAAAlQTFRFAAAA////////c3ilYwAAAAN0Uk5T//8A18oNQQAAAD1JREFUeNp0zlEKACAIA9Bt9z90bZBZkQj29qFBEuBOzQHSnWTTyckEfqUuZgFvslH4ch3qLCO/Kr8cAgwATw4Ax6XRCcoAAAAASUVORK5CYII="), move';
+var zoomSteps = 10;
+var zoomInFactor;
+var zoomOutFactor;
+var windowWidth;
+var windowHeight;
+var svgDoc;
+var minZoom;
+var maxZoom;
+if (!window) window=this;
+
+/**
+ * Show the graph in the middle of the view, scaled to fit
+ */
+function show()
+{
+ if (window.innerHeight) // Firefox
+ {
+ windowWidth = window.innerWidth;
+ windowHeight = window.innerHeight;
+ }
+ else if (document.documentElement.clientWidth) // Chrome/Safari
+ {
+ windowWidth = document.documentElement.clientWidth
+ windowHeight = document.documentElement.clientHeight
+ }
+ if (!windowWidth || !windowHeight) // failsafe
+ {
+ windowWidth = 800;
+ windowHeight = 600;
+ }
+ minZoom = Math.min(Math.min(viewHeight,windowHeight)/viewHeight,Math.min(viewWidth,windowWidth)/viewWidth);
+ maxZoom = minZoom+1.5;
+ zoomInFactor = Math.pow(maxZoom/minZoom,1.0/zoomSteps);
+ zoomOutFactor = 1.0/zoomInFactor;
+
+ var g = svgDoc.getElementById('viewport');
+ try
+ {
+ var bb = g.getBBox(); // this can throw an exception if css { display: none }
+ var tx = (windowWidth-viewWidth*minZoom+8)/(2*minZoom);
+ var ty = viewHeight+(windowHeight-viewHeight*minZoom)/(2*minZoom);
+ var a = 'scale('+minZoom+') rotate(0) translate('+tx+' '+ty+')';
+ g.setAttribute('transform',a);
+ }
+ catch(e) {}
+}
+
+/**
+ * Register handlers
+ */
+function init(evt)
+{
+ svgDoc = evt.target.ownerDocument;
+ try {
+ if (top.window && top.window.registerShow) { // register show function in html doc for dynamic sections
+ top.window.registerShow(sectionId,show);
+ }
+ } catch(e) {
+ // ugh, we are not allowed to talk to the parent; can happen with Chrome when viewing pages
+ // locally, since they treat every local page as having a different origin
+ }
+ show();
+
+ setAttributes(root, {
+ "onmousedown" : "handleMouseDown(evt)",
+ "onmousemove" : "handleMouseMove(evt)",
+ "onmouseup" : "handleMouseUp(evt)"
+ });
+
+ if (window.addEventListener)
+ {
+ if (navigator.userAgent.toLowerCase().indexOf('webkit') >= 0 ||
+ navigator.userAgent.toLowerCase().indexOf("opera") >= 0 ||
+ navigator.appVersion.indexOf("MSIE") != -1)
+ {
+ window.addEventListener('mousewheel', handleMouseWheel, false); // Chrome/Safari/IE9
+ }
+ else
+ {
+ window.addEventListener('DOMMouseScroll', handleMouseWheel, false); // Others
+ }
+ }
+}
+
+window.onresize=function()
+{
+ if (svgDoc) { show(); }
+}
+
+/**
+ * Instance an SVGPoint object with given event coordinates.
+ */
+function getEventPoint(evt)
+{
+ var p = root.createSVGPoint();
+ p.x = evt.clientX;
+ p.y = evt.clientY;
+ return p;
+}
+
+/**
+ * Sets the current transform matrix of an element.
+ */
+function setCTM(element, matrix)
+{
+ var s = "matrix(" + matrix.a + "," + matrix.b + "," + matrix.c + "," + matrix.d + "," + matrix.e + "," + matrix.f + ")";
+ element.setAttribute("transform", s);
+}
+
+/**
+ * Sets attributes of an element.
+ */
+function setAttributes(element, attributes)
+{
+ for (i in attributes)
+ element.setAttributeNS(null, i, attributes[i]);
+}
+
+function doZoom(g,point,zoomFactor)
+{
+ var p = point.matrixTransform(g.getCTM().inverse());
+ var k = root.createSVGMatrix().translate(p.x, p.y).scale(zoomFactor).translate(-p.x, -p.y);
+ var n = g.getCTM().multiply(k);
+ var s = Math.max(n.a,n.d);
+ if (s>maxZoom) n=n.translate(p.x,p.y).scale(maxZoom/s).translate(-p.x,-p.y);
+ else if (s');
+ d.write('Print SVG ');
+ d.write('');
+ d.write(''+xs+'
');
+ d.write('');
+ d.write(' 
1.8.18
+ 
1.8.18 
source ADALINE is one of the first and simplest single layer artificial neural network. The algorithm essentially implements a linear function 
');
+}
+
+function showSyncOn(n,relpath)
+{
+ n.html('
');
+}
+
+function toggleSyncButton(relpath)
+{
+ var navSync = $('#nav-sync');
+ if (navSync.hasClass('sync')) {
+ navSync.removeClass('sync');
+ showSyncOff(navSync,relpath);
+ storeLink(stripPath2(pathName())+hashUrl());
+ } else {
+ navSync.addClass('sync');
+ showSyncOn(navSync,relpath);
+ deleteLink();
+ }
+}
+
+var loadTriggered = false;
+var readyTriggered = false;
+var loadObject,loadToRoot,loadUrl,loadRelPath;
+
+$(window).on('load',function(){
+ if (readyTriggered) { // ready first
+ navTo(loadObject,loadToRoot,loadUrl,loadRelPath);
+ showRoot();
+ }
+ loadTriggered=true;
+});
+
+function initNavTree(toroot,relpath)
+{
+ var o = new Object();
+ o.toroot = toroot;
+ o.node = new Object();
+ o.node.li = document.getElementById("nav-tree-contents");
+ o.node.childrenData = NAVTREE;
+ o.node.children = new Array();
+ o.node.childrenUL = document.createElement("ul");
+ o.node.getChildrenUL = function() { return o.node.childrenUL; };
+ o.node.li.appendChild(o.node.childrenUL);
+ o.node.depth = 0;
+ o.node.relpath = relpath;
+ o.node.expanded = false;
+ o.node.isLast = true;
+ o.node.plus_img = document.createElement("span");
+ o.node.plus_img.className = 'arrow';
+ o.node.plus_img.innerHTML = arrowRight;
+
+ if (localStorageSupported()) {
+ var navSync = $('#nav-sync');
+ if (cachedLink()) {
+ showSyncOff(navSync,relpath);
+ navSync.removeClass('sync');
+ } else {
+ showSyncOn(navSync,relpath);
+ }
+ navSync.click(function(){ toggleSyncButton(relpath); });
+ }
+
+ if (loadTriggered) { // load before ready
+ navTo(o,toroot,hashUrl(),relpath);
+ showRoot();
+ } else { // ready before load
+ loadObject = o;
+ loadToRoot = toroot;
+ loadUrl = hashUrl();
+ loadRelPath = relpath;
+ readyTriggered=true;
+ }
+
+ $(window).bind('hashchange', function(){
+ if (window.location.hash && window.location.hash.length>1){
+ var a;
+ if ($(location).attr('hash')){
+ var clslink=stripPath(pathName())+':'+hashValue();
+ a=$('.item a[class$="'+clslink.replace(/
+
+
+
+
+
+
+
