vertex_cover< Graph, CostMap, OutputIter > Class Template Reference

[Iterative Rounding Problem Example] More...

Public Types
using	Vertex = typename boost::graph_traits< Graph >::vertex_descriptor
using	VertexMap = std::unordered_map< Vertex, paal::lp::col_id >

Public Member Functions
	vertex_cover (const Graph &g, CostMap cost_map, OutputIter cover)
const Graph &	get_graph () const
auto	get_cost (Vertex v) -> decltype(std::declval< CostMap >()(v))
void	bind_col_to_vertex (paal::lp::col_id col, Vertex v)
paal::lp::col_id	vertex_to_column (Vertex v)
void	add_to_cover (Vertex v)

Detailed Description

template<typename Graph, typename CostMap, typename OutputIter>
class vertex_cover< Graph, CostMap, OutputIter >

[Iterative Rounding Problem Example]

Definition at line 34 of file iterative_rounding_example.cpp.

---

The documentation for this class was generated from the following file:

• examples/iterative_rounding/iterative_rounding_example.cpp