permutation.cpp File Reference

#include "storm/utility/permutation.h"
#include <algorithm>
#include <deque>
#include <numeric>
#include <random>
#include "storm/adapters/RationalFunctionAdapter.h"
#include "storm/adapters/RationalNumberAdapter.h"
#include "storm/storage/BitVector.h"
#include "storm/storage/SparseMatrix.h"
#include "storm/utility/macros.h"

Include dependency graph for permutation.cpp:

Go to the source code of this file.

Namespaces
namespace	storm
	LabParser.cpp.
namespace	storm::utility
namespace	storm::utility::permutation

Functions
std::string	storm::utility::permutation::orderKindtoString (OrderKind order)
	Converts the given order to a string.
OrderKind	storm::utility::permutation::orderKindFromString (std::string const &order)
	Gets the order from the given string.
std::vector< std::string >	storm::utility::permutation::orderKinds ()
	Returns a list of possible order kinds.
std::vector< index_type >	storm::utility::permutation::createRandomPermutation (index_type size)
	Creates a random (uniformly distributed) permutation of the given size.
std::vector< index_type >	storm::utility::permutation::createRandomPermutation (index_type size, index_type seed)
	Creates a random (uniformly distributed) permutation of the given size.
template<typename ValueType >
std::vector< index_type >	storm::utility::permutation::createPermutation (OrderKind order, storm::storage::SparseMatrix< ValueType > const &transitionMatrix, storm::storage::BitVector const &initialStates)
	Creates a permutation that orders the states of the given matrix in the given exploration order.
std::vector< index_type >	storm::utility::permutation::invertPermutation (std::vector< index_type > const &permutation)
	Inverts the given permutation.
void	storm::utility::permutation::reversePermutationInPlace (std::vector< index_type > &permutation)
	Reverses the given permutation.
bool	storm::utility::permutation::isValidPermutation (std::vector< index_type > const &permutation)
	Returns true if the given vector is a permutation of the numbers 0, 1, ..., n-1 for n = permutation.size().
template std::vector< index_type >	storm::utility::permutation::createPermutation (OrderKind order, storm::storage::SparseMatrix< double > const &transitionMatrix, storm::storage::BitVector const &initialStates)
template std::vector< index_type >	storm::utility::permutation::createPermutation (OrderKind order, storm::storage::SparseMatrix< storm::RationalNumber > const &transitionMatrix, storm::storage::BitVector const &initialStates)
template std::vector< index_type >	storm::utility::permutation::createPermutation (OrderKind order, storm::storage::SparseMatrix< storm::RationalFunction > const &transitionMatrix, storm::storage::BitVector const &initialStates)
template std::vector< index_type >	storm::utility::permutation::createPermutation (OrderKind order, storm::storage::SparseMatrix< storm::Interval > const &transitionMatrix, storm::storage::BitVector const &initialStates)