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