#include "CGAL/Combination_enumerator.h"
#include <iostream>
#include <vector>
int main()
{
    vector<string> names;
    names.push_back("Sun");    names.push_back("Shannon");
    names.push_back("Hurley"); names.push_back("Sawyer");
    names.push_back("Kate");   names.push_back("Claire");
    names.push_back("John");   names.push_back("Jack");
        combi(2, names.begin(), names.end());
        cout << " {" << *combi[0] << ' ' << *combi[1] << '}';
        ++combi;
    }
    cout << endl;
    return EXIT_SUCCESS;
}
The class Combination_enumerator is used to enumerate all fixed-size combinations (subsets) of a sour...
Definition: Combination_enumerator.h:21
bool finished()
Returns true if and only if all combinations have been enumerated.