e edge " << graph->get_id(inbound) << (graph->get_is_reverse(inbound) ? "-" : "+") << endl; #endif                                                          frame.todo.push_back(inbound);                         } else if (next_along_cycle.count(inbound)) {                             // This edge is the incoming edge for a cycle. Queue it up.                              #ifdef debug                             cerr << "\t\tLook at cycle edge " << graph->get_id(inbound) << (graph->get_is_reverse(inbound) ? "-" : "+") << endl; #endif                             frame.todo.push_back(inbound);                         } else if (cactus.find(graph->flip(inbound)) == cactus.find(inbound) && !graph->get_is_reverse(inbound)) {                             // Count all self edges as empty chains