Template Function pldl::min_maximal_matching

• Defined in File netlist_algo.hpp

Function Documentation

template<typename Netlist, typename C1, typename C2>
auto pldl::min_maximal_matching(const Netlist &H, const C1 &weight, C2 &&matchset, C2 &&dep) -> typename C1::mapped_type

minimum weighted maximal matching problem

The min_maximal_matching function is solving the minimum weighted maximal matching problem using the primal-dual paradigm. It takes in a netlist H, a weight map weight, a matchset container matchset, and a dependency container dep.

Template Parameters

• Netlist –

• C1 –

• C2 –

Parameters

• H –

• weight –

• matchset –

• dep –

Returns

C1::value_type