Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
can_yen Concept Reference

Concept definition

template<class D>
concept can_yen = requires(const LG & g, LG::Node * n, D d) {
yen_k_shortest_paths<LG, D>(g, n, n, 1, d);
}
can_yen
Definition ah_graph_concepts_test.cc:85
Aleph::blossom_maximum_cardinality_matching
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Definition Blossom.H:466

Detailed Description

Definition at line 85 of file ah_graph_concepts_test.cc.