![]() |
Awali
Another Weighted Automata library
|
#include <stack>#include <vector>#include <unordered_set>#include <unordered_map>#include <awali/sttc/misc/unordered_set.hh>#include <awali/sttc/misc/unordered_map.hh>#include <awali/sttc/algos/transpose.hh>#include <awali/sttc/algos/product.hh>#include <awali/sttc/algos/accessible.hh>Go to the source code of this file.
Data Structures | |
| class | awali::sttc::internal::cycle_identity_impl< Aut > |
| Whether the weight of beetween two states on component, it is always unique. More... | |
| class | awali::sttc::internal::reverse_postorder_impl< Aut > |
| Get all vertexs in reverse postorder by using depth first search. More... | |
| class | awali::sttc::internal::scc_kosaraju< Aut > |
| Use Kosajaju algorithm for finding all of strongly connected components. More... | |
Namespaces | |
| awali | |
| Main namespace of Awali. | |
| awali::sttc | |
| Namespace for the static layer of Awali. | |
| awali::sttc::internal | |
| Implementation details of static layer (not stable). | |
Functions | |
| template<typename Aut > | |
| const std::vector< std::unordered_set< state_t > > | awali::sttc::components (const Aut &aut) |
| Find all strongly connected components of aut. More... | |
| template<typename Aut > | |
| bool | awali::sttc::cycle_identity (const std::unordered_set< state_t > &c, const Aut &aut) |
| Check the weight of two states on this component is unique. More... | |
| template<typename Aut > | |
| bool | awali::sttc::has_twins_property (const Aut &aut) |
| Whether aut has the twins property. More... | |
| template<typename Aut > | |
| auto | awali::sttc::inverse (const Aut &aut) -> decltype(::sttc::copy(aut)) |
| template<typename Aut > | |
| Aut & | awali::sttc::inverse_here (Aut &aut) |
| Inverse the weight of all edges of aut. More... | |
| template<typename Aut > | |
| std::stack< state_t > | awali::sttc::reverse_postorder (const Aut &aut) |
| Get all vertices in reverse postorder. More... | |