Lines Matching refs:GT
39 template <class GraphT, class GT = GraphTraits<GraphT>>
42 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType;
45 typedef typename GT::ChildIteratorType ChildItTy;
101 return scc_iterator(GT::getEntryNode(G));
141 template <class GraphT, class GT>
142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) {
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
153 template <class GraphT, class GT>
154 void scc_iterator<GraphT, GT>::DFSVisitChildren() {
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
173 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() {
181 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
210 template <class GraphT, class GT>
211 bool scc_iterator<GraphT, GT>::hasLoop() const {
216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
