#include <gudhi/Simplex_tree.h>
#include <iostream>
int main(int argc, char* const argv[]) {
  
    bool result = false;
    std::cout << "Blocker on [";
    
      
      if (vertex == 6) result = true;
      std::cout << vertex << ", ";
    }
    
    std::cout << " + 1. ) = " << result << std::endl;
    return result;
  });
  std::cout << "********************************************************************\n";
  std::cout << 
"* The complex contains " << stree.
num_simplices() << 
" simplices";
  std::cout << 
"   - dimension " << stree.
dimension() << 
"\n";
  std::cout << "* Iterator on Simplices in the filtration, with [filtration value]:\n";
    std::cout << "   "
    std::cout << std::endl;
  }
  return 0;
}