Function extendPaths

MergePaths/MergePaths.cpp:454–486

Extend the specified path as long as is unambiguously possible and * add the result to the specified container. */

 * add the result to the specified container.
 */
static void
extendPaths(const Lengths& lengths, ContigID id, const ContigPathMap& paths, ContigPathMap& out)
{
	ContigPathMap::const_iterator pathIt = paths.find(id);
	assert(pathIt != paths.end());

	pair<ContigPathMap::iterator, bool> inserted;
#pragma omp critical(out)
	inserted = out.insert(*pathIt);
	assert(inserted.second);
	ContigPath& path = inserted.first->second;

	if (gDebugPrint)
#pragma omp critical(cout)
		cout << "\n* " << get(g_contigNames, id) << "+\n" << '\t' << path << '\n';

	set<ContigNode> seen;
	seen.insert(ContigNode(id, false));
	deque<ContigNode> mergeQ;
	appendToMergeQ(mergeQ, seen, path);
	while (mergePaths(lengths, path, mergeQ, seen, paths) > 0)
		;

	if (!mergeQ.empty() && gDebugPrint) {
#pragma omp critical(cout)
		{
			cout << "invalid\n";
			for (deque<ContigNode>::const_iterator it = mergeQ.begin(); it != mergeQ.end(); ++it)
				cout << get(g_contigNames, *it) << '\t' << paths.find(it->contigIndex())->second
				     << '\n';
		}
	}
}

/** Return true if the contigs are equal or both are ambiguous. */
static bool