vd243wi/usaa24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

26

Browse Source
This commit is contained in:
Deinerovych 2024-11-07 14:45:42 +01:00
parent 80e2744b60
commit e6fcb73d14
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
cv7/program.c
View File

@ -29,21 +29,21 @@ Node* parse_knowledge_base(FILE *file) {
return NULL; return NULL;
} }
line[strcspn(line, "\n")] = 0; // Убираем символ новой строки line[strcspn(line, "\n")] = 0; // Remove newline character
if (line[0] == '*') { if (line[0] == '*') {
return create_node(line + 1); // Создаем узел-ответ, пропуская '*' return create_node(line + 1); // Create answer node, skip '*'
} else { } else {
Node *node = create_node(line); Node *node = create_node(line);
node->yes = parse_knowledge_base(file); // Рекурсивно читаем ответ "да" node->yes = parse_knowledge_base(file); // Recursively read "yes" answer
node->no = parse_knowledge_base(file); // Рекурсивно читаем ответ "нет" node->no = parse_knowledge_base(file); // Recursively read "no" answer
return node; return node;
} }
} }
int count_products(Node *node) { int count_products(Node *node) {
if (!node) return 0; if (!node) return 0;
if (!node->yes && !node->no) return 1; // Если узел - лист (ответ) if (!node->yes && !node->no) return 1; // If node is a leaf (answer)
return count_products(node->yes) + count_products(node->no); return count_products(node->yes) + count_products(node->no);
} }
@ -52,7 +52,7 @@ void run_expert_system(Node *node) {
printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n"); printf("Odpovedajte 'a' pre prvu moznost alebo 'n' pre druhu moznost.\n");
printf("%s\n", node->text); printf("%s\n", node->text);
// Print the options and then the answer if it's a leaf node. // Print the answer if it's a leaf node.
if (!node->yes && !node->no) { if (!node->yes && !node->no) {
printf("*%s\n", node->text); printf("*%s\n", node->text);
printf("Koniec\n"); printf("Koniec\n");
@ -61,17 +61,17 @@ void run_expert_system(Node *node) {
char answer; char answer;
if (scanf(" %c", &answer) != 1) { if (scanf(" %c", &answer) != 1) {
printf("Koniec\n"); // Некорректный ввод, завершение printf("Koniec\n"); // Incorrect input, termination
return; return;
} }
// Переходим к следующему узлу на основе ответа пользователя // Move to the next node based on user's answer
if (answer == 'a') { if (answer == 'a') {
node = node->yes; node = node->yes;
} else if (answer == 'n') { } else if (answer == 'n') {
node = node->no; node = node->no;
} else { } else {
printf("Koniec\n"); // Некорректный ответ, завершение printf("Koniec\n"); // Incorrect answer, termination
return; return;
} }
} }