// De 3-SAT a HAMPATH. Lee una fórmula en DIMACS de la entrada estándar, construye el grafo
// y busca un camino hamiltoniano de s a t.
//   build/hampath < machines/small.cnf
//   build/hampath --grafo < machines/small.cnf      además, la lista de aristas
#include <iostream>
#include <string>

#include "hampath.h"

int main(int argc, char** argv) {
    try {
        bool list = argc > 1 && std::string(argv[1]) == "--grafo";
        Cnf f = read_dimacs(std::cin);
        HamInstance h = build_hampath(f);
        const Digraph& g = h.graph;
        std::cout << "fórmula: " << f.num_vars << " variables, " << f.clauses.size() << " cláusulas\n";
        for (const Clause& c : f.clauses) {
            std::cout << "  " << show_clause(c) << "\n";
        }
        std::cout << "grafo: " << g.size() << " nodos, " << g.edges.size() << " aristas\n";
        if (list) {
            for (const auto& [u, v] : g.edges) {
                std::cout << "  " << g.names[u] << " -> " << g.names[v] << "\n";
            }
        }
        HamSearch search(h, true);
        if (!search.run()) {
            std::cout << "no hay camino hamiltoniano de s a t\n";
            return 0;
        }
        std::cout << "camino hamiltoniano de s a t:\n ";
        std::size_t width = 1;
        for (int v : search.path) {
            const std::string& name = g.names[v];
            if (width + name.size() + 1 > 100) {
                std::cout << "\n ";
                width = 1;
            }
            std::cout << " " << name;
            width += name.size() + 1;
        }
        std::cout << "\n";
        Assignment value = assignment_from_path(h, search.path);
        std::cout << "asignación leída del camino:";
        for (int i = 1; i <= f.num_vars; i++) {
            std::cout << " x" << i << " = " << (value[i] ? "V" : "F");
        }
        std::cout << "\n" << (satisfies(f, value) ? "cumple la fórmula" : "NO cumple la fórmula") << "\n";
    } catch (const std::exception& error) {
        std::cerr << "error: " << error.what() << "\n";
        return 1;
    }
    return 0;
}
