| 510 | } |
| 511 | |
| 512 | static void |
| 513 | removeLongEdges(Graph& g) |
| 514 | { |
| 515 | typedef graph_traits<Graph>::edge_descriptor E; |
| 516 | typedef graph_traits<Graph>::edge_iterator Eit; |
| 517 | |
| 518 | vector<E> long_e; |
| 519 | Eit eit, elast; |
| 520 | for (tie(eit, elast) = edges(g); eit != elast; ++eit) { |
| 521 | E e = *eit; |
| 522 | if (g[e].distance > opt::maxGap) |
| 523 | long_e.push_back(e); |
| 524 | } |
| 525 | remove_edges(g, long_e.begin(), long_e.end()); |
| 526 | } |
| 527 | |
| 528 | /** Return whether the specified distance estimate is an exact |
| 529 | * overlap. |