diff --git a/d6/d7b/sudoku__solve_8cpp.html b/d3/d05/sudoku__solver_8cpp.html similarity index 90% rename from d6/d7b/sudoku__solve_8cpp.html rename to d3/d05/sudoku__solver_8cpp.html index d29cb950f..71e32597c 100644 --- a/d6/d7b/sudoku__solve_8cpp.html +++ b/d3/d05/sudoku__solver_8cpp.html @@ -5,7 +5,7 @@ -
#include <array>#include <iostream>Functions | |
| template<size_t V> | |
| bool | backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n) |
Check if it's possible to place a number (no parameter) More... | |
| bool | backtracking::sudoku_solver::isPossible (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n) |
Check if it's possible to place a number (no parameter) More... | |
| template<size_t V> | |
| void | backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n) |
| Utility function to print the matrix. More... | |
| void | backtracking::sudoku_solver::printMat (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n) |
| Utility function to print the matrix. More... | |
| template<size_t V> | |
| bool | backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j) |
| Main function to implement the Sudoku algorithm. More... | |
| bool | backtracking::sudoku_solver::solveSudoku (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j) |
| Main function to implement the Sudoku algorithm. More... | |
| int | main () |
| Main function. More... | |
| int | main () |
| Main function. More... | |