study_path.h File Reference

#include <fstream>
#include <iostream>
#include <map>
#include <sstream>
#include <vector>
#include <nlohmann/json.hpp>
#include "symphony.h"

Include dependency graph for study_path.h:

Go to the source code of this file.

Classes
class	StudyState
class	StudyProblem

Functions
void	run (std::string &input)

Function Documentation

run()

void run

(

std::string &

input

)

Definition at line 90 of file study_path.h.

                           {
    std::ifstream file(input);
    std::string json_string;
    std::string line;
    while (std::getline(file, line)) {
        json_string += line;
    }
 
    nlohmann::json json = nlohmann::json::parse(json_string);
    std::map<std::string, double> mastery_levels = json["mastery_levels"];
    std::map<std::string, std::vector<std::string>> dependencies = json["dependencies"];
    std::map<std::string, double> synergies = json["synergies"];
    double time = json["time"];
 
 
    auto initial_state = new StudyState(mastery_levels, time); // 7 days, 3 hours/day
    auto problem = new StudyProblem(initial_state, dependencies, synergies);
    auto solution = create_search(BEAM_SEARCH, problem)->search();
 
    if (solution) {
        std::cout << "Optimal study plan:\n";
        auto current = solution;
        while (current) {
            if (current->action) {
                std::cout << "Study " << current->action->name << " for " << current->action->cost << " hours\n";
            }
            current = current->parent;
        }
    } else {
        std::cout << "No solution found within the given time.\n";
    }
    delete problem;
 
}

References BEAM_SEARCH, create_search(), and Search::search().