Concept definition

template<typename It, typename Node, typename Arc>
concept NodeArcIterator =  GraphArcIterator<It, Arc> && requires(const It cit)
{
  { cit.get_tgt_node() } -> std::convertible_to<Node*>;
}

Detailed Description

Concept for node adjacency iterators.

An adjacency iterator iterates over arcs connected to a specific node. It must satisfy GraphArcIterator and additionally provide get_tgt_node() to retrieve the node at the other end of each arc.

Additional required expression:

it.get_tgt_node() : Returns pointer to the target node of current arc

This is the most specific iterator concept, typically satisfied by GT::Node_Arc_Iterator.

Template Parameters

It	The iterator type to check
Node	The expected node type (not pointer)
Arc	The expected arc type (not pointer)

See also: GraphArcIterator

Definition at line 234 of file graph-dry.H.