Exemplos de HashGraph::RestoreAndMergeEdges em C++ (Cpp)

Exemplo n.º 1

Arquivo: assembly_utility.cpp Projeto: binma/idba

void InsertInternalKmers(AssemblyInfo &assembly_info, HashGraph &hash_graph, int min_count)
{
    deque<ShortSequence> &reads = assembly_info.reads;
    deque<Sequence> &long_reads = assembly_info.long_reads;

#pragma omp parallel for schedule(static, 1)
    for (int64_t i = 0; i < (int64_t)reads.size(); ++i)
    {
        Sequence seq(reads[i]);
        hash_graph.InsertInternalKmers(seq, min_count);
    }

#pragma omp parallel for schedule(static, 1)
    for (int64_t i = 0; i < (int64_t)long_reads.size(); ++i)
        hash_graph.InsertInternalKmers(long_reads[i], min_count);

    hash_graph.RestoreAndMergeEdges();
    hash_graph.RefreshEdges();
}