35                               Graph* graph,  in Execute()  argument
40   for (Graph::iterator it = graph->begin(); it != graph->end(); ++it)  in Execute()
44   Tarjan(vertex, graph);  in Execute()
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {  in Tarjan()  argument
50   CHECK_EQ((*graph)[vertex].index, kInvalidIndex);  in Tarjan()
51   (*graph)[vertex].index = index_;  in Tarjan()
52   (*graph)[vertex].lowlink = index_;  in Tarjan()
55   for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin();  in Tarjan()
56        it != (*graph)[vertex].out_edges.end(); ++it) {  in Tarjan()
58     if ((*graph)[vertex_next].index == kInvalidIndex) {  in Tarjan()
59       Tarjan(vertex_next, graph);  in Tarjan()
60       (*graph)[vertex].lowlink = min((*graph)[vertex].lowlink,  in Tarjan()
61                                      (*graph)[vertex_next].lowlink);  in Tarjan()
63       (*graph)[vertex].lowlink = min((*graph)[vertex].lowlink,  in Tarjan()
64                                      (*graph)[vertex_next].index);  in Tarjan()
67   if ((*graph)[vertex].lowlink == (*graph)[vertex].index) {  in Tarjan()