AllCliquesFinder, C++ (vc++)

Language: Layout:

/******************************************************************************
Scope: Finds ALL cliques from Maximal cliques
Solution: Decompose maximal cliques until unity
*******************************************************************************/
#include <stdio.h>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <iterator>
#include <algorithm>
#include <omp.h>
//for gcc add: -fopenmp

int main()
{
    /// Declare data structure
    std::map<int, std::set<std::vector<int>>> cliques;
    
    /// insert "input" vectors
    cliques[5] = {{1, 3, 5, 7, 9}};
    cliques[4] = {{1, 2, 3, 4}};
    
    /// set boundaries
    int kMax = 5;
    int kMin = 1;
    
    /// "fill" all keys lower than my initial key:
    int max_threads = omp_get_max_threads();
    std::cout << "Threads available: " << max_threads << std::endl;
    #pragma omp parallel for schedule(static, 1) num_threads(max_threads)
    for (int i = 1; i < kMax; ++i)
    {
        cliques[i] = std::set<std::vector<int>>();
    }
    
    /// enable/disable parallel execution
    bool parallelExec = true;
    
    /// "decompose" source vectors:
    for (int k = kMax; k > kMin; k--)
    {
      std::set<std::vector<int>>::iterator it = cliques[k].begin();
      #pragma omp parallel num_threads(max_threads) if(parallelExec)
      {
        for(int s = 0; s < cliques[k].size(); ++s)
        {
          std::vector<int> clique;
          /// maybe should be "omp critical"? maybe clique should be private? (or is it already??) 
          #pragma omp single
          { 
            clique = *it;
          }
          for (int v = 0; v < clique.size(); ++v)
          {
            int& vertex = clique[v];
            std::vector<int> new_clique;
            std::copy_if(clique.begin(), clique.end(), std::back_inserter(new_clique), [vertex](const int& elem) { return elem != vertex; });
            int kNew = k - 1;
            #pragma omp critical
            {
                cliques[kNew].insert(new_clique);
            }
          }
          #pragma omp single
          {
            it++;
          }
        }
      }
    }
    
    /// Display results
    for(int i = cliques.size(); i > 0 ; i--)
    {
        auto kSet = cliques[i];
        std::cout << "[" << i << "]: ";  
        for(auto& vec : kSet)
        {
            std::cout << "{";
            for(auto& elem : vec)
            {
                std::cout << elem << " ";  
            }
            std::cout << "} ";
        }
        std::cout << std::endl;
    }
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 2,33 sec, absolute running time: 0,45 sec, absolute service time: 2,79 sec