Template Function pldl::min_vertex_cover(const Graph&, const C1&, C2&)

• Defined in File graph_algo.hpp

Function Documentation

template<typename Graph, typename C1, typename C2>
auto pldl::min_vertex_cover(const Graph &G, const C1 &weight, C2 &cover) -> typename C1::mapped_type

minimum weighted vertex cover problem

The function min_vertex_cover is solving the minimum weighted vertex cover problem using the primal-dual paradigm.

Template Parameters

• Graph –

• C1 –

• C2 –

Parameters

• G – [in]

• weight – [in]

• cover – [inout] initial: pre-covered vetrices

Returns

C1::mapped_type