cdt-opt.cpp

Go to the documentation of this file.

/*******************************************************************************
 Causal Dynamical Triangulations in C++ using CGAL
 
 Copyright © 2016 Adam Getchell
 ******************************************************************************/
 
 
#include <Metropolis.hpp>
#include <Move_always.hpp>
 
using namespace std;
 
auto main() -> int
try
{
  fmt::print("cdt-opt started at {}\n", utilities::current_date_time());
  Int_precision constexpr simplices  = 256;
  Int_precision constexpr timeslices = 4;
  auto constexpr alpha               = static_cast<long double>(0.6);
  auto constexpr k                   = static_cast<long double>(1.1);  // NOLINT
  auto constexpr lambda              = static_cast<long double>(0.1);
  Int_precision constexpr passes     = 10;
  Int_precision constexpr checkpoint = 10;
 
  // Create logs
  utilities::create_logger();
 
  // Initialize the Metropolis algorithm
  Metropolis_3 run(alpha, k, lambda, passes, checkpoint);
 
  // Make a triangulation
  manifolds::Manifold_3 const universe(simplices, timeslices);
 
  // Look at triangulation
  universe.print();
  universe.print_details();
  universe.print_volume_per_timeslice();
 
  // Run algorithm on triangulation
  auto const result = run(universe);
 
  if (auto max_timevalue = result.max_time(); max_timevalue < timeslices)
  {
    spdlog::info("You wanted {} timeslices but only got {}.\n", timeslices,
                 max_timevalue);
  }
 
  if (!result.is_valid()) { throw runtime_error("Result is invalid!\n"); }
 
  // Print results
  fmt::print("=== Run Results ===\n");
  result.print();
  result.print_details();
  result.print_volume_per_timeslice();
 
  return EXIT_SUCCESS;
}
catch (runtime_error const& RuntimeError)
{
  spdlog::critical("{}\n", RuntimeError.what());
  return EXIT_FAILURE;
}
catch (...)
{
  spdlog::critical("Something went wrong ... Exiting.\n");
  return EXIT_FAILURE;
}