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

An arc distance (Distance) for graph GT. More...

#include <ah-graph-concepts.H>

Concept definition

template<class D, class GT>
requires { typename D::Distance_Type; } and
requires(D & d, typename graph_concepts_detail::graph_t<GT>::Arc * a)
{
{ d(a) } -> std::convertible_to<typename D::Distance_Type>;
}
A graph usable by the graph algorithms.
An arc distance (Distance) for graph GT.
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
std::remove_cvref_t< GT > graph_t
GT with cv-qualifiers and references removed.
and
Check uniqueness with explicit hash + equality functors.

Detailed Description

An arc distance (Distance) for graph GT.

Requires a nested Distance_Type and a call on an Arc *, through a non-const lvalue, whose result converts to it. That is the only part of the Dft_Dist interface the algorithms use in general.

Template Parameters
Ddistance functor type.
GTgraph type.

Definition at line 148 of file ah-graph-concepts.H.