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
- Complexity
At most \(O(mn)\) where
m
is nr_nodes() andn
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-neighbours. In other words, if neighbor() is libsemigroups::UNDEFINED for any nodend
and any labellbl
.LibsemigroupsException
: ifi
is not in the range0
tonr_scc()
- 1.