file
netlist_algo.hpp
Functions
-
template<typename Gnl, typename C1, typename C2>auto min_vertex_cover(const Gnl& hyprgraph, const C1& weight, C2& coverset) -> typename C1::mapped_type -> auto
- minimum weighted vertex cover problem
-
template<typename Gnl, typename C1, typename C2>auto min_maximal_matching(const Gnl& hyprgraph, const C1& weight, C2& matchset, C2& dep) -> typename C1::mapped_type -> auto
- minimum weighted maximal matching problem
Function documentation
template<typename Gnl, typename C1, typename C2>
auto min_vertex_cover(const Gnl& hyprgraph,
const C1& weight,
C2& coverset) -> typename C1::mapped_type
minimum weighted vertex cover problem
Template parameters | |
---|---|
Gnl | |
C1 | |
C2 | |
Parameters | |
hyprgraph in | |
weight in | |
coverset in/out | in: pre-covered vetrices, out: sol'n set |
Returns | C1::mapped_type |
This function solves minimum vertex cover problem using primal-dual paradigm:
template<typename Gnl, typename C1, typename C2>
auto min_maximal_matching(const Gnl& hyprgraph,
const C1& weight,
C2& matchset,
C2& dep) -> typename C1::mapped_type
minimum weighted maximal matching problem
Template parameters | |
---|---|
Gnl | |
C1 | |
C2 | |
Parameters | |
hyprgraph in | |
weight in | |
matchset in/out | |
dep in/out | |
Returns | C1::value_type |
This function solves minimum maximal matching problem using primal-dual paradigm: