Lines Matching defs:ei
131 EdgeIterator ei = this->outgoing();
132 for (; !ei.end(); ei.next())
133 if (ei.getNode() == node)
135 if (ei.end()) {
139 delete ei.getEdge();
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) {
187 if (ei.getType() == Edge::BACK)
189 if (ei.getNode()->visit(seq))
190 stack.push(ei.getNode());
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
226 if (ei.getNode()->visit(sequence))
227 search(ei.getNode(), preorder, sequence);
300 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
301 switch (ei.getType()) {
304 if (++(ei.getNode()->tag) == ei.getNode()->incidentCountFwd())
305 bb.push(ei.getNode());
310 if (++(ei.getNode()->tag) == 1)
311 cross.push(ei.getNode());
413 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) {
414 Node *t = ei.getNode();