// before front were set to 0 predecessors during the previous
// iteration. During this new iteration, we have to visit the
// successors of these ones only, since they are the only ones
- // potentially having now predecessors anymore.
+ // which may end up with no predecessors.
new_front = front;
while(already_processed < front) {
v = *(already_processed++);