76   void Tarjan(Node<T>* vertex, Graph<T>& graph);
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) {  in Tarjan()  argument
103   assert(vertex->index == UNDEFINED_INDEX);  in Tarjan()
104   vertex->index = index_;  in Tarjan()
105   vertex->lowlink = index_;  in Tarjan()
107   stack_.push_back(vertex);  in Tarjan()
108   for (auto& it : vertex->references_out) {  in Tarjan()
112       vertex->lowlink = std::min(vertex->lowlink, vertex_next->lowlink);  in Tarjan()
114       vertex->lowlink = std::min(vertex->lowlink, vertex_next->index);  in Tarjan()
117   if (vertex->lowlink == vertex->index) {  in Tarjan()
124     } while (other_vertex != vertex && !stack_.empty());  in Tarjan()