| 403 | } |
| 404 | |
| 405 | static Sequence mergePath(const Graph&g, const Path& path) |
| 406 | { |
| 407 | Sequence seq; |
| 408 | Path::const_iterator prev_it; |
| 409 | for (Path::const_iterator it = path.begin(); |
| 410 | it != path.end(); ++it) { |
| 411 | if (seq.empty()) { |
| 412 | seq = getSequence(*it); |
| 413 | } else { |
| 414 | int d = get(edge_bundle, g, *(it-1), *it).distance; |
| 415 | assert(d < 0); |
| 416 | unsigned overlap = -d; |
| 417 | mergeContigs(g, overlap, seq, |
| 418 | getSequence(*it), *it, path); |
| 419 | } |
| 420 | prev_it = it; |
| 421 | } |
| 422 | return seq; |
| 423 | } |
| 424 | |
| 425 | /** Calculate the ContigProperties of a path. */ |
| 426 | static ContigProperties calculatePathProperties(const Graph& g, |
no test coverage detected