cbegin_pilo

const_pilo_iterator libsemigroups::ActionDigraph::cbegin_pilo(node_type const source, size_t const min = 0, size_t const max = POSITIVE_INFINITY) const

Returns a forward iterator pointing to the edge labels of the first path (in lexicographical order) starting at source with length in the range \([min, max)\).

PILO = Paths In Lexicographical Order

If incremented, the iterator will point to the next least edge labelling of a path (in lexicographical order), with length in the range \([min, max)\). Iterators of the type returned by this function are equal whenever they point to equal objects.

Return

An iterator it of type const_pilo_iterator pointing to a libsemigroups::word_type consisting of the edge labels of the first path (in lexicographical order) from source of length in the range \([min, max)\).

Warning

Copying iterators of this type is expensive. As a consequence, prefix incrementing ++it the returned iterator it significantly cheaper than postfix incrementing it++.

Warning

If the action digraph represented by this contains a cycle that is reachable from source, then there are infinitely many paths starting at source, and so max should be chosen with some care.

See

cend_pilo

Parameters

  • source: the source node

  • min: the minimum length of a path to enumerate (defaults to 0)

  • max: the maximum length of a path to enumerate (defaults to libsemigroups::POSITIVE_INFINITY).

Exceptions