71   void Tarjan(Node<T>* vertex, Graph<T>& graph);
97 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) {  in Tarjan()  argument
98   assert(vertex->index == UNDEFINED_INDEX);  in Tarjan()
99   vertex->index = index_;  in Tarjan()
100   vertex->lowlink = index_;  in Tarjan()
102   stack_.push_back(vertex);  in Tarjan()
103   for (auto& it: vertex->references_out) {  in Tarjan()
107       vertex->lowlink = std::min(vertex->lowlink, vertex_next->lowlink);  in Tarjan()
109       vertex->lowlink = std::min(vertex->lowlink, vertex_next->index);  in Tarjan()
112   if (vertex->lowlink == vertex->index) {  in Tarjan()
119     } while (other_vertex != vertex && !stack_.empty());  in Tarjan()