Lines Matching refs:GT
42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
156 void scc_iterator<GraphT, GT>::DFSVisitChildren() {
158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
175 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() {
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN));
212 template <class GraphT, class GT>
213 bool scc_iterator<GraphT, GT>::hasLoop() const {
218 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
