Concept definition

template<typename It, typename Node>
concept GraphNodeIterator =  BasicGraphIterator<It> && requires(const It cit)
{
  { cit.get_curr() } -> std::convertible_to<Node*>;
}

Detailed Description

Concept for graph node iterators.

A node iterator must satisfy BasicGraphIterator and return a pointer to the specified Node type from get_curr().

This concept is useful when you need to ensure the iterator yields nodes of a specific type.

Template Parameters

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

See also: BasicGraphIterator, GraphArcIterator

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