cend_sccs¶
-
const_iterator_sccs
libsemigroups::ActionDigraph
::
cend_sccs
() const¶ Returns an iterator pointing one past the last vector of nodes in the final scc.
- Return
- Complexity
At most \(O(mn)\) where
m
is nr_nodes() andn
is out_degree().- Parameters
(None)
- 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 nodend
and any labellbl
. If an exception is thrown,this
might be modified but is guaranteed to be in a valid state (basic exception guarantee).