| 69 | */ |
| 70 | template <typename Graph> |
| 71 | size_t splitAmbiguous(Graph* pSC) |
| 72 | { |
| 73 | typedef typename Graph::iterator iterator; |
| 74 | |
| 75 | Timer timer(__func__); |
| 76 | size_t count = 0; |
| 77 | for (iterator it = pSC->begin(); |
| 78 | it != pSC->end(); ++it) { |
| 79 | if (!it->second.deleted()) |
| 80 | continue; |
| 81 | for (extDirection sense = SENSE; |
| 82 | sense <= ANTISENSE; ++sense) { |
| 83 | if (it->second.marked(sense)) { |
| 84 | removeExtensionsToSequence(pSC, *it, sense); |
| 85 | count++; |
| 86 | } |
| 87 | } |
| 88 | pSC->pumpNetwork(); |
| 89 | } |
| 90 | tempCounter[7] += count; |
| 91 | logger(0) << "Split " << count << " ambigiuous branches.\n"; |
| 92 | return count; |
| 93 | } |
| 94 | |
| 95 | } // namespace AssemblyAlgorithms |
| 96 |
no test coverage detected