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

Type changes

Browse Source
This commit is contained in:
Ashish Bhanu Daulatabad 2021-03-20 23:04:58 +05:30
parent b0d74627ad
commit 9ec2a08c8c
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
machine_learning/a_star_search.cpp
View File

@ -404,12 +404,12 @@ static void test() {
[](const machine_learning::aystar_search::EightPuzzle<> &first,
const machine_learning::aystar_search::EightPuzzle<> &second) {
uint32_t ret = 0;
for (uint32_t i = 0; i < first.get_size(); ++i) {
for (uint32_t j = 0; j < first.get_size(); ++j) {
uint32_t find = first.get(i, j);
for (int i = 0; i < first.get_size(); ++i) {
for (int j = 0; j < first.get_size(); ++j) {
int find = first.get(i, j);
int m = -1, n = -1;
for (uint32_t k = 0; k < second.get_size(); ++k) {
for (uint32_t l = 0; l < second.get_size(); ++l) {
for (int k = 0; k < second.get_size(); ++k) {
for (int l = 0; l < second.get_size(); ++l) {
if (find == second.get(k, l)) {
std::tie(m, n) = std::make_pair(k, l);
break;
@ -510,12 +510,12 @@ static void test() {
[](const machine_learning::aystar_search::EightPuzzle<4> &first,
const machine_learning::aystar_search::EightPuzzle<4> &second) {
uint32_t ret = 0;
for (uint32_t i = 0; i < first.get_size(); ++i) {
for (uint32_t j = 0; j < first.get_size(); ++j) {
for (int i = 0; i < first.get_size(); ++i) {
for (int j = 0; j < first.get_size(); ++j) {
int find = first.get(i, j);
int m = -1, n = -1;
for (uint32_t k = 0; k < second.get_size(); ++k) {
for (uint32_t l = 0; l < second.get_size(); ++l) {
for (int k = 0; k < second.get_size(); ++k) {
for (int l = 0; l < second.get_size(); ++l) {
if (find == second.get(k, l)) {
std::tie(m, n) = std::make_pair(k, l);
break;