if (!root) return;

std::queue<Node*> q;

q.push(root);

while (!q.empty()) {

Node* current = q.front();

q.pop();

std::cout << "Visited: " << current->value << std::endl;

for (Node* child : current->children) {

q.push(child);

}

}

if (!root) return;

std::stack<Node*> s;

s.push(root);

while (!s.empty()) {

Node* current = s.top();

s.pop();

std::cout << "Visited: " << current->value << std::endl;

for (Node* child : current->children) {

s.push(child);

}

}

if (depth == 0) {

std::cout << "Visited: " << node->value << std::endl;

return true;

}

for (Node* child : node->children) {

if (DLS(child, depth - 1)) {

return true;

}

}

return false;

for (int depth = 0; depth <= maxDepth; ++depth) {

if (DLS(root, depth)) {

break;

}

}

bool operator()(Node* a, Node* b) {

return a->value > b->value; // assuming the value represents the cost

}

if (!root) return;

std::priority_queue<Node*, std::vector<Node*>, CompareCost> pq;

pq.push(root);

while (!pq.empty()) {

Node* current = pq.top();

pq.pop();

std::cout << "Visited: " << current->value << std::endl;

for (Node* child : current->children) {

pq.push(child);

}

}

bool operator()(Node* a, Node* b) {

return (a->value + SearchAlgorithms::heuristic(a)) > (b->value + SearchAlgorithms::heuristic(b));

}

if (!root) return;

std::priority_queue<Node*, std::vector<Node*>, AStarCompare> pq;

pq.push(root);

while (!pq.empty()) {

Node* current = pq.top();

pq.pop();

std::cout << "Visited: " << current->value << std::endl;

for (Node* child : current->children) {

pq.push(child);

}

}

std::cout << "Visited: " << node->value << std::endl;

if (node->value == goal) {

return true;

}

for (Node* child : node->children) {

if (Backtracking(child, goal)) {

return true;

}

}

return false;

bool operator()(Node* a, Node* b) {

return SearchAlgorithms::heuristic(a) > SearchAlgorithms::heuristic(b);

}

if (!root) return;

// Define a priority queue with a custom comparator for Best-First Search

std::priority_queue<Node*, std::vector<Node*>, BestFirstCompare> pq;

pq.push(root);

while (!pq.empty()) {

Node* current = pq.top();

pq.pop();

std::cout << "Visited: " << current->value << std::endl;

// Check if the current node is the goal

if (current->value == goalValue) {

std::cout << "Goal found: " << current->value << std::endl;

return;

}

for (Node* child : current->children) {

pq.push(child);

}

}

std::cout << "Goal not found" << std::endl;