Function getTreeTraces

RResolver/SequenceTree.cpp:118–170

typedef std::list<Trace> Traces;

static Traces
getTreeTraces(
    const ContigNode& start,
    const int overlap,
    const int maxLength,
    const bool forward,
    const int maxPaths)
{
	assert(maxLength > 0);

	Traces traces;
	std::queue<std::reference_wrapper<Trace>> queue;

	SequenceTreeNode root(start, overlap, maxLength, forward);

	int level = 1;
	(void)level;
	int leaves = 1;
	traces.push_back({ root });
	queue.push(traces.back());
	while (!queue.empty()) {
		Trace& trace = queue.front();
		queue.pop();

		const SequenceTreeNode& node = trace.back();
		assert(node.maxLength > 0 && node.maxLength <= maxLength);

		assert(int(trace.size()) >= level);
		level = trace.size();

		auto children = node.getChildren();
		if ((children.size() > 0) && (leaves + int(children.size()) - 1 <= maxPaths)) {
			for (size_t i = 0; i < children.size(); i++) {
				const auto& child = children[i];
				assert(child.maxLength > 0);
				assert(child.maxLength < node.maxLength);
				if (i < children.size() - 1) {
					Trace childTrace = trace;
					childTrace.push_back(child);
					assert(childTrace.size() == trace.size() + 1);
					traces.push_back(childTrace);
					queue.push(traces.back());
				} else {
					trace.push_back(child);
					queue.push(trace);
				}
			}
			leaves += children.size() - 1;
		}
	}

	return traces;
}

std::vector<Sequence>
getTreeSequences(