OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Code reformatting.

Browse Source
This commit is contained in:
Ashish Bhanu Daulatabad 2021-03-23 18:15:08 +05:30
parent 9ec2a08c8c
commit 53d9d346f4
1 changed files with 11 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
machine_learning/a_star_search.cpp
View File

@ -65,10 +65,13 @@ class EightPuzzle {
* respectively, else returns -1, -1
*/
std::pair<int, int> find_zero() {
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
if (!board[i][j])
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (!board[i][j]) {
return {i, j};
}
}
}
return {-1, -1};
}
/**
@ -91,8 +94,9 @@ class EightPuzzle {
* @returns -1 if invalid i or j position
*/
int get(size_t i, size_t j) const {
if (in_range(i) && in_range(j))
if (in_range(i) && in_range(j)) {
return board[i][j];
}
return -1;
}
/**
@ -157,8 +161,9 @@ class EightPuzzle {
* @returns `true` if check.state is equal to `this->state`, else `false`
*/
bool operator==(const EightPuzzle<N> &check) const {
if (check.get_size() != N)
if (check.get_size() != N) {
return false;
}
for (size_t i = 0; i < N; ++i) {
for (size_t j = 0; j < N; ++j) {
if (board[i][j] != check.board[i][j]) {
@ -552,4 +557,4 @@ static void test() {
int main() {
test(); // run self-test implementations
return 0;
}
}