Searched refs:stack_ (Results 1 – 7 of 7) sorted by relevance
101 DCHECK(stack_.empty()); in BreakCycles()107 stack_.push_back(current_vertex_); in HandleCircuit()108 CHECK_GE(stack_.size(), in HandleCircuit()110 Edge min_edge = make_pair(stack_[0], stack_[1]); in HandleCircuit()113 for (vector<Vertex::Index>::const_iterator it = stack_.begin(); in HandleCircuit()114 it != (stack_.end() - 1); ++it) { in HandleCircuit()117 stack_.pop_back(); in HandleCircuit()130 stack_.pop_back(); in HandleCircuit()146 for (vector<Vertex::Index>::const_iterator it = ++stack_.begin(), in StackContainsCutEdge()147 e = stack_.end(); it != e; ++it) { in StackContainsCutEdge()[all …]
37 stack_.clear(); in Execute()54 stack_.push_back(vertex); in Tarjan()62 } else if (utils::VectorContainsValue(stack_, vertex_next)) { in Tarjan()71 other_vertex = stack_.back(); in Tarjan()72 stack_.pop_back(); in Tarjan()74 } while (other_vertex != vertex && !stack_.empty()); in Tarjan()
46 std::vector<Vertex::Index> stack_; variable
58 std::vector<Vertex::Index> stack_; // the stack variable in the paper variable
66 stack_(allocator), components_(allocator) {} in TarjanAlgorithm()74 allocator::vector<Node<T>*> stack_; variable80 stack_.clear(); in Execute()102 stack_.push_back(vertex); in Tarjan()108 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) { in Tarjan()116 other_vertex = stack_.back(); in Tarjan()117 stack_.pop_back(); in Tarjan()119 } while (other_vertex != vertex && !stack_.empty()); in Tarjan()
71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN); in PtracerThread()72 if (stack_->top() == nullptr) { in PtracerThread()89 stack_ = nullptr; in ~PtracerThread()101 child_pid_ = clone(proxy, stack_->top(), in Start()
44 std::unique_ptr<Stack> stack_; variable