Iterative rounding example This is an example implementation of an algorithm within the Iterative Rounding framework. The implemented algorithm is a vertex cover 2-approximation. More...
#include "paal/iterative_rounding/iterative_rounding.hpp"
#include "paal/utils/floating.hpp"
#include "paal/utils/functors.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/range/iterator_range.hpp>
#include <iostream>
#include <unordered_map>
Go to the source code of this file.
Classes | |
class | vertex_cover< Graph, CostMap, OutputIter > |
[Iterative Rounding Problem Example] More... | |
struct | vertex_cover_init |
[Iterative Rounding Problem Example] More... | |
struct | vertex_cover_set_solution |
Typedefs | |
using | vertex_cover_ir_components = ir::IRcomponents< vertex_cover_init, ir::round_condition_greater_than_half, paal::utils::always_false, vertex_cover_set_solution > |
Functions | |
int | main () |
[Iterative Rounding Components Example] More... | |
Iterative rounding example This is an example implementation of an algorithm within the Iterative Rounding framework. The implemented algorithm is a vertex cover 2-approximation.
Definition in file iterative_rounding_example.cpp.
int main | ( | ) |
[Iterative Rounding Components Example]
[Iterative Rounding Example]
Definition at line 110 of file iterative_rounding_example.cpp.