cend_scc

const_iterator_scc libsemigroups::ActionDigraph::cend_scc(scc_index_type i) const

Returns an iterator pointing one past the last node in the scc with the specified id-number.

Return

A ActionDigraph::const_iterator_scc.

Complexity

At most \(O(mn)\) where m is nr_nodes() and n is out_degree().

Note

If an exception is thrown, this might be modified but is guaranteed to be in a valid state (basic exception guarantee).

Parameters

• i: the id-number of the scc.

Exceptions

• LibsemigroupsException: if it is not the case that every node has exactly out_degree() out-neighbors. In other words, if neighbor() is libsemigroups::UNDEFINED for any node nd and any label lbl.

• LibsemigroupsException: if i is not in the range 0 to nr_scc() - 1.