Template Function ADS::listRankIndependentSet

Function Documentation

template<class R>
std::vector<std::size_t> ADS::listRankIndependentSet(const std::vector<std::size_t> &succ, R &g, bool deterministic = false, std::size_t *levels = nullptr)

the distances from the tail, by removing independent sets, random ones drawn by g or, if deterministic, the local minima of the three colors; the levels of the recursion go to *levels, if given

Pre:

succ is a list (an audit)

Post:

the ranks of listRank() (an audit)