Concept for Aleph sequential containers with traversal and append semantics.
More...
#include <ah-unique.H>
template<class Container>
typename Container::Key_Type v,
bool (&op)(
typename Container::Key_Type &))
{
typename Container::Key_Type;
{ c.traverse(op) } -> std::convertible_to<bool>;
c.append(v);
c.swap(c);
{ c.size() } -> std::convertible_to<size_t>;
}
Concept for Aleph sequential containers with traversal and append semantics.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Concept for Aleph sequential containers with traversal and append semantics.
Definition at line 51 of file ah-unique.H.