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

Concept definition

template<class G>
concept can_for_each_node = requires(const G & g) { for_each_node(g, [](auto *) {}); }
Aleph::List_Graph
Graph implemented with double-linked adjacency lists.
Definition tpl_graph.H:429
can_for_each_node
Definition ah_graph_concepts_test.cc:107
Aleph::for_each_node
void for_each_node(const GT &g, Op operation, SN sn=SN())
Traverse all the nodes of graph filtering some ones according to a condition and executing an operati...
Definition tpl_graph.H:1240

Detailed Description

Definition at line 107 of file ah_graph_concepts_test.cc.