Lines Matching refs:scc_
411 : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
430 if (front_ > back_) front_ = back_ = scc_[s];
431 else if (scc_[s] > back_) back_ = scc_[s];
432 else if (scc_[s] < front_) front_ = scc_[s];
433 if ((*queue_)[scc_[s]]) {
434 (*queue_)[scc_[s]]->Enqueue(s);
436 while ( (StateId)trivial_queue_.size() <= scc_[s])
438 trivial_queue_[scc_[s]] = s;
452 if ((*queue_)[scc_[s]])
453 (*queue_)[scc_[s]]->Update(s);
480 const vector<StateId> &scc_;
525 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &props);
527 StateId nscc = *max_element(scc_.begin(), scc_.end()) + 1;
538 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial,
551 queue_ = new TopOrderQueue<StateId>(scc_);
585 queue_ = new SccQueue< StateId, QueueBase<StateId> >(scc_, &queues_);
613 vector<StateId> scc_;
