Concept definition

template<typename It>
concept BasicGraphIterator =  requires(It it, const It cit)
{
  { cit.has_curr() } -> std::convertible_to<bool>;
  { it.next() } -> std::same_as<void>;
  { it.get_curr() };
}

Detailed Description

Concept for basic graph iterators.

A type satisfies BasicGraphIterator if it provides the fundamental iteration interface used throughout Aleph-w graph implementations.

Required expressions:

it.has_curr() : Returns bool, true if iterator points to valid element
it.next() : Advances iterator to next element, returns void
it.get_curr() : Returns current element (pointer), may throw if invalid

Template Parameters

It	The iterator type to check

See also: ResettableGraphIterator, GraphNodeIterator, GraphArcIterator

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