Concept definition

template<class G>

concept can_clear_graph = requires(G & g) { clear_graph(g); }

Graph implemented with double-linked adjacency lists.

Definition tpl_graph.H:429

Definition ah_graph_concepts_test.cc:103

void clear_graph(GT &g) noexcept

Clean a graph: all its nodes and arcs are removed and freed.

Definition tpl_graph.H:3659

Detailed Description

Definition at line 103 of file ah_graph_concepts_test.cc.