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

Concept definition

template<class G>
concept can_out_nodes = requires(typename G::Node * p) { out_nodes<G>(p); }
Aleph::List_Graph::Node
_Graph_Node Node
The graph type.
Definition tpl_graph.H:433
can_out_nodes
Definition ah_graph_concepts_test.cc:111
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 111 of file ah_graph_concepts_test.cc.