paal::ir::bdmst_relax_condition Struct Reference

#include <bounded_degree_mst.hpp>

Public Member Functions
template<typename Problem , typename LP >
bool	operator() (Problem &problem, const LP &lp, lp::row_id row)

Detailed Description

Relax Condition of the IR Bounded Degree MST algorithm.

Definition at line 380 of file bounded_degree_mst.hpp.

Member Function Documentation

template<typename Problem , typename LP >

bool paal::ir::bdmst_relax_condition::operator() ( Problem &  problem, const LP &  lp, lp::row_id  row  )

inline

Checks if a given row of the LP corresponds to a degree bound and can be relaxed. If the row degree is not greater than the corresponding degree bound + 1, it is relaxed and the degree bound is deleted from the problem.

Definition at line 389 of file bounded_degree_mst.hpp.

---

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

• include/paal/iterative_rounding/bounded_degree_min_spanning_tree/bounded_degree_mst.hpp