32 std::vector<SimplexId> &visitedIds)
39 this->isVisited_[id] =
false;
42 this->visitedIds_.clear();
46 this->isVisited_[id] =
true;
47 this->visitedIds_.emplace_back(
id);
51 if(!this->isVisited_[
id]) {
55 = std::find(this->visitedIds_.begin(), this->visitedIds_.end(),
id);
56 if(it != this->visitedIds_.end()) {
57 this->visitedIds_.erase(it);
59 this->isVisited_[id] =
false;
int SimplexId
Identifier type for simplices of any dimension.
Auto-cleaning re-usable graph propagations data structure.
VisitedMask(std::vector< bool > &isVisited, std::vector< SimplexId > &visitedIds)
std::vector< bool > & isVisited_
void insert(const SimplexId id)
std::vector< SimplexId > & visitedIds_
bool remove(const SimplexId id)