| 163 | } |
| 164 | |
| 165 | void SubgraphIterator::SkipNode() { |
| 166 | if (AtEnd()) { |
| 167 | return; |
| 168 | } |
| 169 | for (auto next = link_map_it_; next != (*id_it_)->links().end(); ++next) { |
| 170 | link_map_it_ = next; |
| 171 | } |
| 172 | link_idx_ = link_map_it_->second.size() - 1; |
| 173 | } |
| 174 | |
| 175 | bool SubgraphIterator::PropagateNext() { |
| 176 | // Loops are used to skip over the empty entries. |