Template Function pldl::min_maximal_independent_set

• Defined in File graph_algo.hpp

Function Documentation

template<typename Graph, typename C1, typename C2>
auto pldl::min_maximal_independent_set(const Graph &G, const C1 &weight, C2 &indset, C2 &dep) -> typename C1::mapped_type

minimum weigthed maximal independent set problem

The function min_maximal_independent_set is solving the minimum maximal independent set problem using the primal-dual paradigm.

Template Parameters

• Graph –

• C1 –

• C2 –

Parameters

• G – [in]

• weight – [in]

• indset – [inout]

• dep – [inout]

Returns

C1::value_type