|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Extended lexicographic permutation and k-combination enumeration. More...
#include <iomanip>#include <iostream>#include <utility>#include <ah-comb-generators.H>#include <ah-comb.H>#include <print_rule.H>Go to the source code of this file.
Functions | |
| int | main () |
Extended lexicographic permutation and k-combination enumeration.
Sections [1]-[5] use the eager step primitives and materializing builders from ah-comb.H; [6]-[7] show their lazy, coroutine-based counterparts from ah-comb-generators.H.
Definition in file combinatorics_enumeration_example.cc.
| int main | ( | void | ) |
Definition at line 241 of file combinatorics_enumeration_example.cc.
References Aleph::blossom_maximum_cardinality_matching().