![]() |
libsemigroups
v3.0.0
C++ library for semigroups and monoids
|
This namespace contains helper functions for the Paths class.
Enumerations | |
enum class | algorithm { dfs = 0 , matrix , acyclic , trivial , automatic } |
An enum for specifying the algorithm to the functions number_of_paths(). More... | |
|
strong |
Enumerator | |
---|---|
dfs | Use a depth-first-search. |
matrix | Use the adjacency matrix and matrix multiplication. |
acyclic | Use a dynamic programming approach for acyclic word graphs. |
trivial | Try to utilise some corner cases. |
automatic | The function number_of_paths() tries to decide which algorithm is best. |