39# ifndef TPL_TEST_CONNECTIVITY_H
40# define TPL_TEST_CONNECTIVITY_H
68 template <AlephGraph GT, ArcFilter<GT> SA = Dft_Show_Arc<GT> >
87 <<
"test_connectivity() does not work on digraphs";
111 <<
"test_connectivity() does not work on digraphs";
Exception handling system with formatted messages for Aleph-w.
#define ah_domain_error_if(C)
Throws std::domain_error if condition holds.
C++20 concepts for the protocol shared by graph algorithms.
constexpr size_t get_num_nodes() const noexcept
Return the total of nodes of graph.
bool is_digraph() const noexcept
Return true if the graph this is directed.
constexpr size_t get_num_arcs() const noexcept
Determines if a graph g is connected.
bool operator()(GT &g, SA &&sa=SA()) const
Invokes the connectivity test.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
Utility algorithms and operations for graphs.