diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html
index e73ae70a1..2438dec54 100644
--- a/d7/dba/cll_8h_source.html
+++ b/d7/dba/cll_8h_source.html
@@ -147,6 +147,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
static const std::string codec(const std::string &text, const matrix< int > &key)
Convenience function to perform block cipher operations. The operations are identical for both encryp...
Definition: hill_cipher.cpp:210
+
static void test()
Test implementations.
Definition: rat_maze.cpp:84
int main()
Definition: vigenere_cipher.cpp:131
int main()
Definition: sudoku_solve.cpp:131
static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
Definition: hill_cipher.cpp:339
@@ -154,6 +155,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
Implementation of Hill Cipher algorithm.
Definition: hill_cipher.cpp:81
int main()
Definition: nqueen_print_all_solutions.cpp:98
int main()
Definition: n_queens.cpp:118
+
bool solveMaze(int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
Solve rat maze problem.
Definition: rat_maze.cpp:45
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
@@ -200,6 +202,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
void MinHeapify(int)
Definition: binaryheap.cpp:113
int height(node *root)
Definition: avltree.cpp:31
+
int main()
Main function.
Definition: rat_maze.cpp:110
Functions for XOR cipher algorithm.
void test()
Definition: vigenere_cipher.cpp:111
node * rightRotate(node *root)
Definition: avltree.cpp:41
@@ -248,6 +251,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
void test()
Definition: caesar_cipher.cpp:100
int getBalance(node *root)
Definition: avltree.cpp:38
+
Functions for Rat in a Maze algorithm.
int main()
Definition: graph_coloring.cpp:96
Definition: binary_search_tree.cpp:17
int extractMin()
Definition: binaryheap.cpp:85
diff --git a/d9/d60/namespacerat__maze.html b/d9/d60/namespacerat__maze.html
new file mode 100644
index 000000000..ca8e72569
--- /dev/null
+++ b/d9/d60/namespacerat__maze.html
@@ -0,0 +1,114 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: rat_maze Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Functions for Rat in a Maze algorithm.
+More...
+
+
Functions for Rat in a Maze algorithm.
+
+
+
+
+
+
diff --git a/da/d01/rat__maze_8cpp__incl.map b/da/d01/rat__maze_8cpp__incl.map
new file mode 100644
index 000000000..58e45cc83
--- /dev/null
+++ b/da/d01/rat__maze_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/da/d01/rat__maze_8cpp__incl.md5 b/da/d01/rat__maze_8cpp__incl.md5
new file mode 100644
index 000000000..8dcb83912
--- /dev/null
+++ b/da/d01/rat__maze_8cpp__incl.md5
@@ -0,0 +1 @@
+9c83f179cf7c9f208ddec70b812f2541
\ No newline at end of file
diff --git a/da/d01/rat__maze_8cpp__incl.svg b/da/d01/rat__maze_8cpp__incl.svg
new file mode 100644
index 000000000..805a660ee
--- /dev/null
+++ b/da/d01/rat__maze_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+backtracking/rat_maze.cpp
+
+Node1
+
+backtracking/rat_maze.cpp
+
+
+
+
+Node2
+
+array
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+cassert
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/dc/d5a/rat__maze_8cpp.html b/dc/d5a/rat__maze_8cpp.html
new file mode 100644
index 000000000..353a2da13
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp.html
@@ -0,0 +1,336 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: backtracking/rat_maze.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Implements Rat in a Maze algorithm.
+More...
+
#include <array>#include <iostream>#include <cassert>
+
+
Implements Rat in a Maze algorithm.
+
A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down. In the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination.
+
Author Vaibhav Thakkar
+David Leal
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
◆
+
+
+
+
+template<size_t size>
+
+
+ bool backtracking::rat_maze::solveMaze
+ (
+ int
+ currposrow ,
+
+ int
+ currposcol ,
+
+ const std::array < std::array < int, size >, size > &
+ maze ,
+
+ std::array < std::array < int, size >, size > soln
+
+ )
+
+
+
+
+
Solve rat maze problem.
+
Template Parameters
+
+ size number of matrix size
+
+
+
Parameters
+
+ currposrow current position in rows currposcol current position in columns maze matrix where numbers are saved soln matrix to problem solution
+
+
+
Returns 0 on end
+
+
48 if ((currposrow == size - 1) && (currposcol == size - 1)) {
+
49 soln[currposrow][currposcol] = 1;
+
50 for (
int i = 0; i < size; ++i) {
+
51 for (
int j = 0; j < size; ++j) {
+
+
+
+
+
+
+
58 soln[currposrow][currposcol] = 1;
+
+
+
61 if ((currposcol < size - 1) && maze[currposrow][currposcol + 1] == 1 &&
+
62 solveMaze (currposrow, currposcol + 1, maze, soln)) {
+
+
+
+
+
67 if ((currposrow < size - 1) && maze[currposrow + 1][currposcol] == 1 &&
+
68 solveMaze (currposrow + 1, currposcol, maze, soln)) {
+
+
+
+
+
73 soln[currposrow][currposcol] = 0;
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Test implementations.
+
Returns void
+
+
+
+
87 std::array<int, size> {1, 0, 1, 0},
std::array<int, size> {1, 0, 1, 1},
+
+
+
+
+
+
93 for (
int i = 0; i < size; ++i) {
+
94 for (
int j = 0; j < size; ++j) {
+
+
+
+
+
+
+
+
102 assert(backtracking::rat_maze::solveMaze<size>(currposrow, currposcol, maze,
+
+
+
+
+
+
+
+
static void test()
Test implementations.
Definition: rat_maze.cpp:84
+
bool solveMaze(int currposrow, int currposcol, const std::array< std::array< int, size >, size > &maze, std::array< std::array< int, size >, size > soln)
Solve rat maze problem.
Definition: rat_maze.cpp:45
+
+
+
+
+
+
+
diff --git a/dc/d5a/rat__maze_8cpp.js b/dc/d5a/rat__maze_8cpp.js
new file mode 100644
index 000000000..d90154c70
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp.js
@@ -0,0 +1,6 @@
+var rat__maze_8cpp =
+[
+ [ "main", "dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "solveMaze", "dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3", null ],
+ [ "test", "dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map
new file mode 100644
index 000000000..f5a18c61a
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5 b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5
new file mode 100644
index 000000000..96a0a4c0f
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5
@@ -0,0 +1 @@
+80704ea421a3d975b99070415de14598
\ No newline at end of file
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg
new file mode 100644
index 000000000..c9b933f23
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+backtracking::rat_maze::solveMaze
+
+Node1
+
+backtracking::rat_maze
+::solveMaze
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..a9d00dc2c
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..6f7a0f700
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+e9cb2c320b334c5cfdea47f24a882076
\ No newline at end of file
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..1bdc2a7bb
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html
index 19ca84d50..3225b4d24 100644
--- a/dir_c11585dfcef32a26e29098facab6c144.html
+++ b/dir_c11585dfcef32a26e29098facab6c144.html
@@ -112,6 +112,10 @@ Files
file nqueen_print_all_solutions.cpp Eight Queens puzzle, printing all solutions
+
file rat_maze.cpp
+
Implements Rat in a Maze algorithm.
+
file sudoku_solve.cpp Sudoku Solver algorithm.
diff --git a/dir_c11585dfcef32a26e29098facab6c144.js b/dir_c11585dfcef32a26e29098facab6c144.js
index 60d0888c6..02e8b91d0 100644
--- a/dir_c11585dfcef32a26e29098facab6c144.js
+++ b/dir_c11585dfcef32a26e29098facab6c144.js
@@ -5,5 +5,6 @@ var dir_c11585dfcef32a26e29098facab6c144 =
[ "minimax.cpp", "df/dfb/minimax_8cpp.html", "df/dfb/minimax_8cpp" ],
[ "n_queens.cpp", "d4/d3e/n__queens_8cpp.html", "d4/d3e/n__queens_8cpp" ],
[ "nqueen_print_all_solutions.cpp", "d7/d24/nqueen__print__all__solutions_8cpp.html", "d7/d24/nqueen__print__all__solutions_8cpp" ],
+ [ "rat_maze.cpp", "dc/d5a/rat__maze_8cpp.html", "dc/d5a/rat__maze_8cpp" ],
[ "sudoku_solve.cpp", "d6/d7b/sudoku__solve_8cpp.html", "d6/d7b/sudoku__solve_8cpp" ]
];
\ No newline at end of file
diff --git a/files.html b/files.html
index 6c65fff8a..304e6b230 100644
--- a/files.html
+++ b/files.html
@@ -102,7 +102,9 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
minimax.cpp Returns which is the longest/shortest number using minimax algorithm n_queens.cpp Eight Queens puzzle nqueen_print_all_solutions.cpp Eight Queens puzzle, printing all solutions
-
sudoku_solve.cpp Sudoku Solver algorithm
+
rat_maze.cpp Implements Rat in a Maze algorithm
+
sudoku_solve.cpp Sudoku Solver algorithm ► ciphers caesar_cipher.cpp Implementation of Caesar cipher algorithm hill_cipher.cpp Implementation of Hill cipher algorithm
diff --git a/globals_func_m.html b/globals_func_m.html
index e24b2eaf4..85b6e53d1 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -97,25 +97,25 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
:
graph_coloring.cpp
,
knight_tour.cpp
,
n_queens.cpp
-,
hill_cipher.cpp
-,
skip_list.cpp
-,
spirograph.cpp
-,
power_for_huge_numbers.cpp
-,
shell_sort2.cpp
-,
strand_sort.cpp
-,
prime_factorization.cpp
-,
brute_force_string_searching.cpp
-,
horspool.cpp
-,
jumpgame.cpp
-,
prime_numbers.cpp
-,
knuth_morris_pratt.cpp
-,
rabin_karp.cpp
-,
primes_up_to_billion.cpp
-,
trie_modern.cpp
-,
chaining.cpp
-,
realtime_stats.cpp
-,
sieve_of_eratosthenes.cpp
+,
caesar_cipher.cpp
+,
queue_using_two_stacks.cpp
+,
lowest_common_ancestor.cpp
+,
number_of_positive_divisors.cpp
,
quick_sort_3.cpp
+,
shell_sort2.cpp
+,
power_for_huge_numbers.cpp
+,
strand_sort.cpp
+,
brute_force_string_searching.cpp
+,
spirograph.cpp
+,
prime_factorization.cpp
+,
horspool.cpp
+,
knuth_morris_pratt.cpp
+,
prime_numbers.cpp
+,
rabin_karp.cpp
+,
skip_list.cpp
+,
jumpgame.cpp
+,
primes_up_to_billion.cpp
+,
realtime_stats.cpp
,
quick_sort.cpp
,
pigeonhole_sort.cpp
,
merge_sort.cpp
@@ -171,15 +171,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
brent_method_extrema.cpp
,
bisection_method.cpp
,
sum_of_digits.cpp
-,
double_hash_hash_table.cpp
-,
sqrt_double.cpp
,
string_fibonacci.cpp
-,
vigenere_cipher.cpp
-,
trie_tree.cpp
+,
chaining.cpp
+,
sieve_of_eratosthenes.cpp
+,
sqrt_double.cpp
+,
hill_cipher.cpp
+,
trie_modern.cpp
+,
double_hash_hash_table.cpp
,
linear_probing_hash_table.cpp
-,
quadratic_probing_hash_table.cpp
-,
cut_rod.cpp
-,
number_of_positive_divisors.cpp
+,
trie_tree.cpp
,
modular_inverse_fermat_little_theorem.cpp
,
miller_rabin.cpp
,
least_common_multiple.cpp
@@ -203,15 +203,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
ordinary_least_squares_regressor.cpp
,
neural_network.cpp
,
kohonen_som_trace.cpp
-,
adaline_learning.cpp
,
kohonen_som_topology.cpp
+,
quadratic_probing_hash_table.cpp
+,
adaline_learning.cpp
,
nqueen_print_all_solutions.cpp
-,
xor_cipher.cpp
+,
vigenere_cipher.cpp
+,
cut_rod.cpp
,
kadane2.cpp
+,
xor_cipher.cpp
,
shortest_common_supersequence.cpp
-,
avltree.cpp
-,
jarvis_algorithm.cpp
-,
lowest_common_ancestor.cpp
,
is_graph_bipartite.cpp
,
hopcroft_karp.cpp
,
hamiltons_cycle.cpp
@@ -220,13 +220,14 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
,
connected_components.cpp
,
breadth_first_search.cpp
,
line_segment_intersection.cpp
+,
jarvis_algorithm.cpp
,
minimax.cpp
-,
sudoku_solve.cpp
+,
rat_maze.cpp
+,
avltree.cpp
,
disjoint_set.cpp
+,
sudoku_solve.cpp
,
linked_list.cpp
-,
caesar_cipher.cpp
,
linkedlist_implentation_usingarray.cpp
-,
queue_using_two_stacks.cpp
mat_mul()
: qr_eigen_values.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index bf073ba75..5580875de 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -97,32 +97,34 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: ternary_search.cpp
test()
-: caesar_cipher.cpp
-, xor_cipher.cpp
-, jarvis_algorithm.cpp
-, sum_of_digits.cpp
-, smallest_circle.cpp
-, is_graph_bipartite.cpp
-, median_search.cpp
-, bogo_sort.cpp
-, trie_tree.cpp
-, jumpgame.cpp
-, gnome_sort.cpp
-, heap_sort.cpp
-, neural_network.cpp
-, merge_insertion_sort.cpp
-, strand_sort.cpp
+: rat_maze.cpp
, vigenere_cipher.cpp
-, cut_rod.cpp
-, armstrong_number.cpp
-, horspool.cpp
-, check_amicable_pair.cpp
, shortest_common_supersequence.cpp
-, double_factorial.cpp
, fibonacci.cpp
+, sum_of_digits.cpp
+, jarvis_algorithm.cpp
+, smallest_circle.cpp
+, median_search.cpp
+, xor_cipher.cpp
+, is_graph_bipartite.cpp
+, bogo_sort.cpp
+, gnome_sort.cpp
+, jumpgame.cpp
+, heap_sort.cpp
+, merge_insertion_sort.cpp
+, caesar_cipher.cpp
+, trie_tree.cpp
+, neural_network.cpp
+, strand_sort.cpp
+, horspool.cpp
+, armstrong_number.cpp
+, cut_rod.cpp
+, check_amicable_pair.cpp
+, double_factorial.cpp
test1()
-: brent_method_extrema.cpp
+: sum_of_digits.cpp
+, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
, lu_decompose.cpp
@@ -133,7 +135,6 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
-, sum_of_digits.cpp
test2()
: hill_cipher.cpp
@@ -151,21 +152,21 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, smallest_circle.cpp
test3()
-: golden_search_extrema.cpp
+: brent_method_extrema.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, brent_method_extrema.cpp
+, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2d_classes()
: kohonen_som_topology.cpp
@@ -202,26 +203,26 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: postfix_evaluation.cpp
test_int()
-: quick_sort_3.cpp
-, shell_sort2.cpp
+: shell_sort2.cpp
+, quick_sort_3.cpp
test_lamniscate()
: kohonen_som_trace.cpp
tests()
-: sieve_of_eratosthenes.cpp
+: lowest_common_ancestor.cpp
+, check_factorial.cpp
+, sieve_of_eratosthenes.cpp
+, least_common_multiple.cpp
+, double_factorial.cpp
+, hopcroft_karp.cpp
+, comb_sort.cpp
+, insertion_sort.cpp
+, dijkstra.cpp
+, breadth_first_search.cpp
+, number_of_positive_divisors.cpp
, connected_components.cpp
, complex_numbers.cpp
-, number_of_positive_divisors.cpp
-, insertion_sort.cpp
-, hopcroft_karp.cpp
-, double_factorial.cpp
-, least_common_multiple.cpp
-, dijkstra.cpp
-, comb_sort.cpp
-, check_factorial.cpp
-, lowest_common_ancestor.cpp
-, breadth_first_search.cpp
, miller_rabin.cpp
TH()
diff --git a/globals_m.html b/globals_m.html
index dbd4705f4..d3fa2413c 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -97,36 +97,36 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: graph_coloring.cpp
, knight_tour.cpp
, n_queens.cpp
-, hill_cipher.cpp
-, skip_list.cpp
-, spirograph.cpp
-, power_for_huge_numbers.cpp
-, shell_sort2.cpp
-, strand_sort.cpp
-, prime_factorization.cpp
-, brute_force_string_searching.cpp
-, horspool.cpp
-, jumpgame.cpp
-, prime_numbers.cpp
-, knuth_morris_pratt.cpp
-, rabin_karp.cpp
-, primes_up_to_billion.cpp
-, trie_modern.cpp
-, chaining.cpp
-, realtime_stats.cpp
-, sieve_of_eratosthenes.cpp
-, double_hash_hash_table.cpp
-, sqrt_double.cpp
-, string_fibonacci.cpp
-, vigenere_cipher.cpp
-, trie_tree.cpp
-, linear_probing_hash_table.cpp
-, sum_of_digits.cpp
-, bisection_method.cpp
-, quadratic_probing_hash_table.cpp
-, brent_method_extrema.cpp
-, false_position.cpp
+, caesar_cipher.cpp
+, queue_using_two_stacks.cpp
+, lowest_common_ancestor.cpp
+, number_of_positive_divisors.cpp
, quick_sort_3.cpp
+, shell_sort2.cpp
+, power_for_huge_numbers.cpp
+, strand_sort.cpp
+, brute_force_string_searching.cpp
+, spirograph.cpp
+, prime_factorization.cpp
+, horspool.cpp
+, knuth_morris_pratt.cpp
+, prime_numbers.cpp
+, rabin_karp.cpp
+, skip_list.cpp
+, jumpgame.cpp
+, primes_up_to_billion.cpp
+, realtime_stats.cpp
+, chaining.cpp
+, sieve_of_eratosthenes.cpp
+, sqrt_double.cpp
+, hill_cipher.cpp
+, trie_modern.cpp
+, double_hash_hash_table.cpp
+, string_fibonacci.cpp
+, sum_of_digits.cpp
+, linear_probing_hash_table.cpp
+, bisection_method.cpp
+, brent_method_extrema.cpp
, quick_sort.cpp
, pigeonhole_sort.cpp
, merge_sort.cpp
@@ -176,21 +176,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, ode_forward_euler.cpp
, newton_raphson_method.cpp
, lu_decompose.cpp
-, cut_rod.cpp
-, adaline_learning.cpp
-, gaussian_elimination.cpp
, golden_search_extrema.cpp
-, kohonen_som_topology.cpp
+, trie_tree.cpp
+, quadratic_probing_hash_table.cpp
+, false_position.cpp
+, gaussian_elimination.cpp
+, adaline_learning.cpp
, nqueen_print_all_solutions.cpp
-, xor_cipher.cpp
-, kadane2.cpp
+, vigenere_cipher.cpp
+, cut_rod.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
+, kadane2.cpp
, neural_network.cpp
-, shortest_common_supersequence.cpp
, ordinary_least_squares_regressor.cpp
-, armstrong_number.cpp
-, avltree.cpp
-, number_of_positive_divisors.cpp
+, xor_cipher.cpp
, modular_inverse_fermat_little_theorem.cpp
, miller_rabin.cpp
, least_common_multiple.cpp
@@ -208,25 +208,26 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, complex_numbers.cpp
, check_prime.cpp
, check_factorial.cpp
-, jarvis_algorithm.cpp
-, binary_exponent.cpp
, check_amicable_pair.cpp
-, line_segment_intersection.cpp
+, shortest_common_supersequence.cpp
+, armstrong_number.cpp
+, binary_exponent.cpp
+, jarvis_algorithm.cpp
, minimax.cpp
-, sudoku_solve.cpp
-, disjoint_set.cpp
+, rat_maze.cpp
+, avltree.cpp
+, line_segment_intersection.cpp
, breadth_first_search.cpp
+, disjoint_set.cpp
, connected_components.cpp
-, linked_list.cpp
, depth_first_search.cpp
-, dijkstra.cpp
-, caesar_cipher.cpp
-, linkedlist_implentation_usingarray.cpp
-, lowest_common_ancestor.cpp
+, sudoku_solve.cpp
+, linked_list.cpp
, is_graph_bipartite.cpp
-, hamiltons_cycle.cpp
, hopcroft_karp.cpp
-, queue_using_two_stacks.cpp
+, dijkstra.cpp
+, hamiltons_cycle.cpp
+, linkedlist_implentation_usingarray.cpp
mat_mul()
: qr_eigen_values.cpp
@@ -238,18 +239,18 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: lu_decomposition.h
MAX
-: paranthesis_matching.cpp
-, power_for_huge_numbers.cpp
-, ternary_search.cpp
+: power_for_huge_numbers.cpp
, fibonacci_fast.cpp
, hash_search.cpp
+, ternary_search.cpp
+, paranthesis_matching.cpp
MAX_ITER
: adaline_learning.cpp
MAX_ITERATIONS
-: false_position.cpp
-, bisection_method.cpp
+: bisection_method.cpp
+, false_position.cpp
, newton_raphson_method.cpp
merge()
diff --git a/globals_t.html b/globals_t.html
index 27dc60646..d5106eaa0 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -97,32 +97,34 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: ternary_search.cpp
test()
-: caesar_cipher.cpp
-, xor_cipher.cpp
-, jarvis_algorithm.cpp
-, sum_of_digits.cpp
-, smallest_circle.cpp
-, is_graph_bipartite.cpp
-, median_search.cpp
-, bogo_sort.cpp
-, trie_tree.cpp
-, jumpgame.cpp
-, gnome_sort.cpp
-, heap_sort.cpp
-, neural_network.cpp
-, merge_insertion_sort.cpp
-, strand_sort.cpp
+: rat_maze.cpp
, vigenere_cipher.cpp
-, cut_rod.cpp
-, armstrong_number.cpp
-, horspool.cpp
-, check_amicable_pair.cpp
, shortest_common_supersequence.cpp
-, double_factorial.cpp
, fibonacci.cpp
+, sum_of_digits.cpp
+, jarvis_algorithm.cpp
+, smallest_circle.cpp
+, median_search.cpp
+, xor_cipher.cpp
+, is_graph_bipartite.cpp
+, bogo_sort.cpp
+, gnome_sort.cpp
+, jumpgame.cpp
+, heap_sort.cpp
+, merge_insertion_sort.cpp
+, caesar_cipher.cpp
+, trie_tree.cpp
+, neural_network.cpp
+, strand_sort.cpp
+, horspool.cpp
+, armstrong_number.cpp
+, cut_rod.cpp
+, check_amicable_pair.cpp
+, double_factorial.cpp
test1()
-: brent_method_extrema.cpp
+: sum_of_digits.cpp
+, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
, lu_decompose.cpp
@@ -133,7 +135,6 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
-, sum_of_digits.cpp
test2()
: hill_cipher.cpp
@@ -151,17 +152,17 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, smallest_circle.cpp
test3()
-: golden_search_extrema.cpp
+: brent_method_extrema.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
-, brent_method_extrema.cpp
+, golden_search_extrema.cpp
, smallest_circle.cpp
test_1()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2()
: heavy_light_decomposition.cpp
@@ -171,8 +172,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: kohonen_som_topology.cpp
test_3()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -212,20 +213,20 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: brute_force_string_searching.cpp
tests()
-: least_common_multiple.cpp
+: lowest_common_ancestor.cpp
, complex_numbers.cpp
-, hopcroft_karp.cpp
-, connected_components.cpp
-, breadth_first_search.cpp
, number_of_positive_divisors.cpp
+, hopcroft_karp.cpp
, check_factorial.cpp
-, sieve_of_eratosthenes.cpp
+, least_common_multiple.cpp
+, double_factorial.cpp
+, miller_rabin.cpp
, comb_sort.cpp
+, connected_components.cpp
, insertion_sort.cpp
, dijkstra.cpp
-, double_factorial.cpp
-, lowest_common_ancestor.cpp
-, miller_rabin.cpp
+, breadth_first_search.cpp
+, sieve_of_eratosthenes.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespaces.html b/namespaces.html
index f89522ca5..ed1b5a2b7 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -125,18 +125,20 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm N rat_maze Functions for Rat in a Maze algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N XOR Functions for XOR cipher algorithm 
1.8.20
+