| 255 | } |
| 256 | |
| 257 | static void |
| 258 | appendToMergeQ(deque<ContigNode>& mergeQ, set<ContigNode>& seen, const ContigPath& path) |
| 259 | { |
| 260 | for (ContigPath::const_iterator it = path.begin(); it != path.end(); ++it) |
| 261 | if (!it->ambiguous() && seen.insert(*it).second) |
| 262 | mergeQ.push_back(*it); |
| 263 | } |
| 264 | |
| 265 | /** A path overlap graph. */ |
| 266 | typedef ContigGraph<DirectedGraph<>> PathGraph; |