Remove the specified contig from the adjacency graph. */
| 347 | |
| 348 | /** Remove the specified contig from the adjacency graph. */ |
| 349 | static void |
| 350 | removeContigs(Graph& g, vector<vertex_descriptor>& sc) |
| 351 | { |
| 352 | typedef graph_traits<Graph> GTraits; |
| 353 | typedef GTraits::vertex_descriptor V; |
| 354 | |
| 355 | vector<vertex_descriptor> out; |
| 356 | out.reserve(sc.size()); |
| 357 | |
| 358 | vector<bool> markedContigs(g.num_vertices()); |
| 359 | for (vector<vertex_descriptor>::iterator it = sc.begin(); it != sc.end(); ++it) { |
| 360 | V v = *it; |
| 361 | if (opt::verbose > 0 && ++g_count.checked % 10000000 == 0) |
| 362 | cerr << "Removed " << g_count.removed << "/" << g_count.checked |
| 363 | << " vertices that have been checked.\n"; |
| 364 | |
| 365 | if (markedContigs[get(vertex_index, g, v)]) { |
| 366 | out.push_back(v); |
| 367 | continue; |
| 368 | } |
| 369 | |
| 370 | if (!removable(&g, v)) |
| 371 | continue; |
| 372 | |
| 373 | vector<EdgeInfo> eds; |
| 374 | if (findNewEdges(g, v, eds, markedContigs)) |
| 375 | addNewEdges(g, eds); |
| 376 | else |
| 377 | continue; |
| 378 | |
| 379 | removeContig(v, g); |
| 380 | } |
| 381 | sc.swap(out); |
| 382 | } |
| 383 | |
| 384 | /** Return the value of the bit at the specified index. */ |
| 385 | struct Marked |
no test coverage detected