2 #ifndef _LILC_MATRIX_FIND_LEVEL_SET_H_ 3 #define _LILC_MATRIX_FIND_LEVEL_SET_H_ 5 template<
class el_type>
8 for (idx_it node_it = lvl_set.begin(); node_it != lvl_set.end(); node_it++) {
10 for (idx_it it = list[*node_it].begin(); it != list[*node_it].end(); it++) {
13 new_set.push_back(*it);
17 for (idx_it it = m_idx[*node_it].begin(); it != m_idx[*node_it].end(); it++) {
20 new_set.push_back(*it);
25 if (new_set.empty())
return false;
27 lvl_set.swap(new_set);
bool find_level_set(vector< int > &lvl_set, vector< bool > &visited)
Returns the next level set given the current level set of A. This is essentially all neighbours of th...
Definition: lilc_matrix_find_level_set.h:6