Lines Matching defs:vertex
34 void TarjanAlgorithm::Execute(Vertex::Index vertex,
42 required_vertex_ = vertex;
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_;
54 stack_.push_back(vertex);
55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin();
56 it != (*graph)[vertex].out_edges.end(); ++it) {
60 (*graph)[vertex].lowlink = min((*graph)[vertex].lowlink,
63 (*graph)[vertex].lowlink = min((*graph)[vertex].lowlink,
67 if ((*graph)[vertex].lowlink == (*graph)[vertex].index) {
74 } while (other_vertex != vertex && !stack_.empty());