51 cout <<
"s = "; s.
for_each([] (
auto c) { cout << c <<
" "; });
61 row.for_each([] (
auto i) { cout << i <<
" "; });
67 aux.for_each([] (
const auto &
row)
69 row.for_each([] (
auto i) { cout << i <<
" "; });
Combinatorics utilities: permutations, combinations, and matrix transposition.
Doubly-linked list (defined in tpl_dynList.H).
void for_each(Operation &operation)
Traverse all the container and performs an operation on each element.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
bool traverse_perm(const DynList< DynList< T > > &l, Op &op)
*/
DynList< DynList< T > > transpose(const DynList< DynList< T > > &l)
*/
void in_place_transpose(C< C< T > > &l)
In-place transpose of a rectangular matrix stored as a nested container.