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