ActionDigraph¶
-
template<typename T>
class ActionDigraph¶ Defined in
digraph.hpp
.This class represents the digraph of an action of a semigroup on a set. If the digraph has
n
nodes, they are represented by the numbers \({0, ..., n - 1}\), and every node has the same numberm
of out-edges (edges with source that node and range any other node). The numberm
is referred to as the out-degree of the digraph, or any of its nodes.- See
- tparam T
the type of the nodes in the digraph, must be an unsigned integer type.
Aliases¶
Constructors¶
Modifiers¶
Nodes, edges, neighbors¶
Strongly connected components¶
Spanning forests¶
Paths¶
- cbegin_panilo
- cbegin_panislo
- cbegin_pilo
- cbegin_pislo
- cbegin_pstilo
- cbegin_pstislo
- cend_panilo
- cend_panislo
- cend_pilo
- cend_pislo
- cend_pstilo
- cend_pstislo
- number_of_paths(node_type const) const
- number_of_paths(node_type const, node_type const, size_t const, size_t const, algorithm const) const
- number_of_paths(node_type const, size_t const, size_t const, algorithm const) const
- number_of_paths_algorithm(node_type const) const
- number_of_paths_algorithm(node_type const, node_type const, size_t const, size_t const) const
- number_of_paths_algorithm(node_type const, size_t const, size_t const) const