From 0af13939549c9a013e907488a8b6694eb370bafd Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Tue, 5 Jan 2021 09:46:48 +0000 Subject: [PATCH] Documentation for 9a78d690832ddf39564f29457442e1b9159e9834 --- d6/d7b/sudoku__solve_8cpp.html | 53 +++---- d6/d7b/sudoku__solve_8cpp.js | 4 +- d7/dba/cll_8h_source.html | 6 +- db/dc0/namespacebacktracking.html | 138 ++++++++++-------- ...a76e21cb3934368d01cea7672d3906_cgraph.map} | 0 ...a76e21cb3934368d01cea7672d3906_cgraph.md5} | 0 ...a76e21cb3934368d01cea7672d3906_cgraph.svg} | 0 namespacemembers.html | 4 +- namespacemembers_func.html | 4 +- navtreeindex2.js | 4 +- search/all_11.js | 2 +- search/all_14.js | 2 +- search/functions_10.js | 2 +- search/functions_13.js | 2 +- 14 files changed, 120 insertions(+), 101 deletions(-) rename db/dc0/{namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.map => namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.map} (100%) rename db/dc0/{namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.md5 => namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.md5} (100%) rename db/dc0/{namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.svg => namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg} (100%) diff --git a/d6/d7b/sudoku__solve_8cpp.html b/d6/d7b/sudoku__solve_8cpp.html index 2f25aba4b..64e961758 100644 --- a/d6/d7b/sudoku__solve_8cpp.html +++ b/d6/d7b/sudoku__solve_8cpp.html @@ -120,12 +120,12 @@ Functions template<size_t V> bool backtracking::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)   -template<size_t V> -void backtracking::printMat (const std::array< std::array< int, V >, V > &mat, int n) -  -template<size_t V> -bool backtracking::solveSudoku (std::array< std::array< int, V >, V > &mat, int i, int j) -  +template<size_t V> +void backtracking::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n) +  +template<size_t V> +bool backtracking::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j) +  int main ()   @@ -152,26 +152,27 @@ Functions

Main function

-
131  {
-
132  const int V = 9;
-
133  std::array <std::array <int, V>, V> mat = {
-
134  std::array <int, V> {5, 3, 0, 0, 7, 0, 0, 0, 0},
-
135  std::array <int, V> {6, 0, 0, 1, 9, 5, 0, 0, 0},
-
136  std::array <int, V> {0, 9, 8, 0, 0, 0, 0, 6, 0},
-
137  std::array <int, V> {8, 0, 0, 0, 6, 0, 0, 0, 3},
-
138  std::array <int, V> {4, 0, 0, 8, 0, 3, 0, 0, 1},
-
139  std::array <int, V> {7, 0, 0, 0, 2, 0, 0, 0, 6},
-
140  std::array <int, V> {0, 6, 0, 0, 0, 0, 2, 8, 0},
-
141  std::array <int, V> {0, 0, 0, 4, 1, 9, 0, 0, 5},
-
142  std::array <int, V> {0, 0, 0, 0, 8, 0, 0, 7, 9}
-
143  };
-
144 
-
145  backtracking::printMat<V>(mat, 9);
-
146  std::cout << "Solution " << std::endl;
-
147  backtracking::solveSudoku<V>(mat, 0, 0);
-
148 
-
149  return 0;
-
150 }
+
137  {
+
138  const int V = 9;
+
139  std::array <std::array <int, V>, V> mat = {
+
140  std::array <int, V> {5, 3, 0, 0, 7, 0, 0, 0, 0},
+
141  std::array <int, V> {6, 0, 0, 1, 9, 5, 0, 0, 0},
+
142  std::array <int, V> {0, 9, 8, 0, 0, 0, 0, 6, 0},
+
143  std::array <int, V> {8, 0, 0, 0, 6, 0, 0, 0, 3},
+
144  std::array <int, V> {4, 0, 0, 8, 0, 3, 0, 0, 1},
+
145  std::array <int, V> {7, 0, 0, 0, 2, 0, 0, 0, 6},
+
146  std::array <int, V> {0, 6, 0, 0, 0, 0, 2, 8, 0},
+
147  std::array <int, V> {0, 0, 0, 4, 1, 9, 0, 0, 5},
+
148  std::array <int, V> {0, 0, 0, 0, 8, 0, 0, 7, 9}
+
149  };
+
150 
+
151  backtracking::printMat<V>(mat, mat, 9);
+
152  std::cout << "Solution " << std::endl;
+
153  std::array <std::array <int, V>, V> starting_mat = mat;
+
154  backtracking::solveSudoku<V>(mat, starting_mat, 0, 0);
+
155 
+
156  return 0;
+
157 }
Here is the call graph for this function:
diff --git a/d6/d7b/sudoku__solve_8cpp.js b/d6/d7b/sudoku__solve_8cpp.js index 0f11ecb15..4bff529c7 100644 --- a/d6/d7b/sudoku__solve_8cpp.js +++ b/d6/d7b/sudoku__solve_8cpp.js @@ -2,6 +2,6 @@ var sudoku__solve_8cpp = [ [ "isPossible", "d6/d7b/sudoku__solve_8cpp.html#a80af16e57cfb6aaab2bf1da4c4db3308", null ], [ "main", "d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "printMat", "d6/d7b/sudoku__solve_8cpp.html#a4664b23ed7939e3df1c0cb23013eec0c", null ], - [ "solveSudoku", "d6/d7b/sudoku__solve_8cpp.html#af6b62cbc209d7e13ffca0ab3ed3392b6", null ] + [ "printMat", "d6/d7b/sudoku__solve_8cpp.html#ae1a76e21cb3934368d01cea7672d3906", null ], + [ "solveSudoku", "d6/d7b/sudoku__solve_8cpp.html#a2b98ee79cdbc02ffd7b1f786f9696892", null ] ]; \ No newline at end of file diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index 3e831ea8f..4f791dc4d 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -151,12 +151,13 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
std::string
STL class.
test
static void test()
Test implementations.
Definition: rat_maze.cpp:84
main
int main()
Definition: vigenere_cipher.cpp:131
-
main
int main()
Definition: sudoku_solve.cpp:131
+
main
int main()
Definition: sudoku_solve.cpp:137
ciphers::HillCipher::generate_encryption_key
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
ciphers::HillCipher
Implementation of Hill Cipher algorithm.
Definition: hill_cipher.cpp:81
main
int main()
Definition: nqueen_print_all_solutions.cpp:98
main
int main()
Definition: n_queens.cpp:118
+
backtracking::printMat
void printMat(const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)
Definition: sudoku_solve.cpp:67
backtracking::rat_maze::solveMaze
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
std::vector
STL class.
std::string::find
T find(T... args)
@@ -165,6 +166,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
backtracking::n_queens_optimized::CanIMove
bool CanIMove(const std::array< std::array< int, n >, n > &board, int row, int col)
Definition: n_queens_all_solution_optimised.cpp:59
MinHeap::deleteKey
void deleteKey(int i)
Definition: binaryheap.cpp:105
backtracking
Backtracking algorithms.
Definition: graph_coloring.cpp:26
+
backtracking::solveSudoku
bool solveSudoku(std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)
Definition: sudoku_solve.cpp:97
MinHeap
Definition: binaryheap.cpp:10
main
int main()
Definition: minimax.cpp:54
MinHeap::heap_size
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
@@ -196,7 +198,6 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
insert
node * insert(node *root, int item)
Definition: avltree.cpp:66
main
int main()
Definition: graph_coloring.cpp:96
ciphers::HillCipher::get_inverse
static matrix< double > get_inverse(matrix< T > const &A)
Definition: hill_cipher.cpp:250
-
backtracking::printMat
void printMat(const std::array< std::array< int, V >, V > &mat, int n)
Definition: sudoku_solve.cpp:66
ciphers::HillCipher::generate_decryption_key
static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
Generate decryption matrix from an encryption matrix key.
Definition: hill_cipher.cpp:371
h
int h(int key)
Definition: hash_search.cpp:45
@@ -250,7 +251,6 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
n_queens_optimized
Functions for Eight Queens puzzle optimized.
operator<<
static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: hill_cipher.cpp:54
-
backtracking::solveSudoku
bool solveSudoku(std::array< std::array< int, V >, V > &mat, int i, int j)
Definition: sudoku_solve.cpp:91
std::make_pair
T make_pair(T... args)
std::time
T time(T... args)
std::setw
T setw(T... args)
diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html index 0bd6e2612..abe8c8b40 100644 --- a/db/dc0/namespacebacktracking.html +++ b/db/dc0/namespacebacktracking.html @@ -123,12 +123,12 @@ Functions template<size_t V> bool isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)   -template<size_t V> -void printMat (const std::array< std::array< int, V >, V > &mat, int n) -  -template<size_t V> -bool solveSudoku (std::array< std::array< int, V >, V > &mat, int i, int j) -  +template<size_t V> +void printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n) +  +template<size_t V> +bool solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j) + 

Detailed Description

Backtracking algorithms.

@@ -502,8 +502,8 @@ Here is the call graph for this function:
- -

◆ printMat()

+ +

◆ printMat()

@@ -516,6 +516,12 @@ template<size_t V>
const std::array< std::array< int, V >, V > &  mat, + + + + const std::array< std::array< int, V >, V > &  + starting_mat, + @@ -538,29 +544,34 @@ template<size_t V>
Parameters
+
matmatrix where numbers are saved
starting_matcopy of mat, required by printMat for highlighting the differences
nnumber of times loop will run
Returns
void
-
66  {
-
67  for (int i = 0; i < n; i++) {
-
68  for (int j = 0; j < n; j++) {
-
69  std::cout << mat[i][j] << " ";
-
70  if ((j + 1) % 3 == 0) {
-
71  std::cout << '\t';
-
72  }
-
73  }
-
74  if ((i + 1) % 3 == 0) {
-
75  std::cout << std::endl;
-
76  }
-
77  std::cout << std::endl;
-
78  }
-
79  }
+
67  {
+
68  for (int i = 0; i < n; i++) {
+
69  for (int j = 0; j < n; j++) {
+
70  if (starting_mat[i][j] != mat[i][j]) {
+
71  std::cout << "\033[93m" << mat[i][j] << "\033[0m" << " ";
+
72  } else {
+
73  std::cout << mat[i][j] << " ";
+
74  }
+
75  if ((j + 1) % 3 == 0) {
+
76  std::cout << '\t';
+
77  }
+
78  }
+
79  if ((i + 1) % 3 == 0) {
+
80  std::cout << std::endl;
+
81  }
+
82  std::cout << std::endl;
+
83  }
+
84  }
Here is the call graph for this function:
-
+
@@ -709,8 +720,8 @@ Here is the call graph for this function:
- -

◆ solveSudoku()

+ +

◆ solveSudoku()

@@ -723,6 +734,12 @@ template<size_t V>
std::array< std::array< int, V >, V > &  mat, + + + + const std::array< std::array< int, V >, V > &  + starting_mat, + @@ -751,6 +768,7 @@ template<size_t V>
Parameters
+
matmatrix where numbers are saved
starting_matcopy of mat, required by printMat for highlighting the differences
icurrent index in rows
jcurrent index in columns
@@ -767,41 +785,41 @@ template<size_t V>

Place the 'no' - assuming a solution will exist

Couldn't find a solution loop will place the next no.

Solution couldn't be found for any of the numbers provided

-
91  {
-
92  /// Base Case
-
93  if (i == 9) {
-
94  /// Solved for 9 rows already
-
95  backtracking::printMat<V>(mat, 9);
-
96  return true;
-
97  }
-
98 
-
99  /// Crossed the last Cell in the row
-
100  if (j == 9) {
-
101  return backtracking::solveSudoku<V>(mat, i + 1, 0);
-
102  }
-
103 
-
104  /// Blue Cell - Skip
-
105  if (mat[i][j] != 0) {
-
106  return backtracking::solveSudoku<V>(mat, i, j + 1);
-
107  }
-
108  /// White Cell
-
109  /// Try to place every possible no
-
110  for (int no = 1; no <= 9; no++) {
-
111  if (backtracking::isPossible<V>(mat, i, j, no, 9)) {
-
112  /// Place the 'no' - assuming a solution will exist
-
113  mat[i][j] = no;
-
114  bool solution_found = backtracking::solveSudoku<V>(mat, i, j + 1);
-
115  if (solution_found) {
-
116  return true;
-
117  }
-
118  /// Couldn't find a solution
-
119  /// loop will place the next no.
-
120  }
-
121  }
-
122  /// Solution couldn't be found for any of the numbers provided
-
123  mat[i][j] = 0;
-
124  return false;
-
125  }
+
97  {
+
98  /// Base Case
+
99  if (i == 9) {
+
100  /// Solved for 9 rows already
+
101  backtracking::printMat<V>(mat, starting_mat, 9);
+
102  return true;
+
103  }
+
104 
+
105  /// Crossed the last Cell in the row
+
106  if (j == 9) {
+
107  return backtracking::solveSudoku<V>(mat, starting_mat, i + 1, 0);
+
108  }
+
109 
+
110  /// Blue Cell - Skip
+
111  if (mat[i][j] != 0) {
+
112  return backtracking::solveSudoku<V>(mat, starting_mat, i, j + 1);
+
113  }
+
114  /// White Cell
+
115  /// Try to place every possible no
+
116  for (int no = 1; no <= 9; no++) {
+
117  if (backtracking::isPossible<V>(mat, i, j, no, 9)) {
+
118  /// Place the 'no' - assuming a solution will exist
+
119  mat[i][j] = no;
+
120  bool solution_found = backtracking::solveSudoku<V>(mat, starting_mat, i, j + 1);
+
121  if (solution_found) {
+
122  return true;
+
123  }
+
124  /// Couldn't find a solution
+
125  /// loop will place the next no.
+
126  }
+
127  }
+
128  /// Solution couldn't be found for any of the numbers provided
+
129  mat[i][j] = 0;
+
130  return false;
+
131  }
diff --git a/db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.map b/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.map similarity index 100% rename from db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.map rename to db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.map diff --git a/db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.md5 b/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.md5 similarity index 100% rename from db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.md5 rename to db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.md5 diff --git a/db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.svg b/db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg similarity index 100% rename from db/dc0/namespacebacktracking_a4664b23ed7939e3df1c0cb23013eec0c_cgraph.svg rename to db/dc0/namespacebacktracking_ae1a76e21cb3934368d01cea7672d3906_cgraph.svg diff --git a/namespacemembers.html b/namespacemembers.html index a5a73f093..f5fee5512 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -324,7 +324,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza : math
  • printMat() -: backtracking +: backtracking
  • printSolution() : backtracking @@ -403,7 +403,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza : backtracking
  • solveSudoku() -: backtracking +: backtracking
  • spirograph() : spirograph diff --git a/namespacemembers_func.html b/namespacemembers_func.html index bd81f1730..fb961e29d 100644 --- a/namespacemembers_func.html +++ b/namespacemembers_func.html @@ -318,7 +318,7 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR : math
  • printMat() -: backtracking +: backtracking
  • printSolution() : backtracking @@ -394,7 +394,7 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR : backtracking
  • solveSudoku() -: backtracking +: backtracking
  • spirograph() : spirograph diff --git a/navtreeindex2.js b/navtreeindex2.js index 73b489d47..846cc0b1f 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -228,10 +228,10 @@ var NAVTREEINDEX2 = "d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[10,0,12,5,6], "d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,12,5,3], "d6/d7b/sudoku__solve_8cpp.html":[10,0,0,7], -"d6/d7b/sudoku__solve_8cpp.html#a4664b23ed7939e3df1c0cb23013eec0c":[10,0,0,7,2], +"d6/d7b/sudoku__solve_8cpp.html#a2b98ee79cdbc02ffd7b1f786f9696892":[10,0,0,7,3], "d6/d7b/sudoku__solve_8cpp.html#a80af16e57cfb6aaab2bf1da4c4db3308":[10,0,0,7,0], +"d6/d7b/sudoku__solve_8cpp.html#ae1a76e21cb3934368d01cea7672d3906":[10,0,0,7,2], "d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[10,0,0,7,1], -"d6/d7b/sudoku__solve_8cpp.html#af6b62cbc209d7e13ffca0ab3ed3392b6":[10,0,0,7,3], "d6/d80/double__hash__hash__table_8cpp.html":[10,0,8,1], "d6/d80/double__hash__hash__table_8cpp.html#a0d90726ed1de7b3d2ae261baed048003":[10,0,8,1,6], "d6/d80/double__hash__hash__table_8cpp.html#a0e2ff0f9cfc7b54e60a6561f792d8b26":[10,0,8,1,17], diff --git a/search/all_11.js b/search/all_11.js index 5e5c32693..9cb094240 100644 --- a/search/all_11.js +++ b/search/all_11.js @@ -86,7 +86,7 @@ var searchData= ['print_1449',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234::Print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp']]], ['printarray_1450',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], ['printf_1451',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['printmat_1452',['printMat',['../db/dc0/namespacebacktracking.html#a4664b23ed7939e3df1c0cb23013eec0c',1,'backtracking']]], + ['printmat_1452',['printMat',['../db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906',1,'backtracking']]], ['printnode_1453',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], ['printroot_1454',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], ['printsol_1455',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]], diff --git a/search/all_14.js b/search/all_14.js index 7039328ad..1eee75f7d 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -128,7 +128,7 @@ var searchData= ['solve_1752',['solve',['../db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a',1,'backtracking']]], ['solvemaze_1753',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], ['solvenq_1754',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], - ['solvesudoku_1755',['solveSudoku',['../db/dc0/namespacebacktracking.html#af6b62cbc209d7e13ffca0ab3ed3392b6',1,'backtracking']]], + ['solvesudoku_1755',['solveSudoku',['../db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892',1,'backtracking']]], ['sort_1756',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]], ['sort_5fheap_1757',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], ['sorting_1758',['sorting',['../d5/d91/namespacesorting.html',1,'sorting'],['../d5/d4c/group__sorting.html',1,'(Global Namespace)']]], diff --git a/search/functions_10.js b/search/functions_10.js index 1c7b9084f..c0c0deaac 100644 --- a/search/functions_10.js +++ b/search/functions_10.js @@ -56,7 +56,7 @@ var searchData= ['print_4125',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234::Print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9',1,'print(): sieve_of_eratosthenes.cpp']]], ['printarray_4126',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]], ['printf_4127',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], - ['printmat_4128',['printMat',['../db/dc0/namespacebacktracking.html#a4664b23ed7939e3df1c0cb23013eec0c',1,'backtracking']]], + ['printmat_4128',['printMat',['../db/dc0/namespacebacktracking.html#ae1a76e21cb3934368d01cea7672d3906',1,'backtracking']]], ['printnode_4129',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]], ['printroot_4130',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]], ['printsol_4131',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]], diff --git a/search/functions_13.js b/search/functions_13.js index a3fa9e5b6..a96a51e4e 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -103,7 +103,7 @@ var searchData= ['solve_4349',['solve',['../db/dc0/namespacebacktracking.html#a932e38e8912742cedf7b5a837168e03a',1,'backtracking']]], ['solvemaze_4350',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]], ['solvenq_4351',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]], - ['solvesudoku_4352',['solveSudoku',['../db/dc0/namespacebacktracking.html#af6b62cbc209d7e13ffca0ab3ed3392b6',1,'backtracking']]], + ['solvesudoku_4352',['solveSudoku',['../db/dc0/namespacebacktracking.html#a2b98ee79cdbc02ffd7b1f786f9696892',1,'backtracking']]], ['sort_4353',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]], ['sort_5fheap_4354',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], ['spiralprint_4355',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]],