You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
36 lines
1.0 KiB
36 lines
1.0 KiB
#ifndef STORM_PARSER_TRAPARSER_H_
|
|
#define STORM_PARSER_TRAPARSER_H_
|
|
|
|
#include "src/storage/SparseMatrix.h"
|
|
|
|
#include "src/parser/Parser.h"
|
|
#include "src/utility/OsDetection.h"
|
|
|
|
#include <memory>
|
|
|
|
namespace storm {
|
|
namespace parser {
|
|
|
|
/*!
|
|
* @brief Load a deterministic transition system from file and create a
|
|
* sparse adjacency matrix whose entries represent the weights of the edges
|
|
*/
|
|
class DeterministicSparseTransitionParser : public Parser {
|
|
public:
|
|
DeterministicSparseTransitionParser(std::string const &filename, bool insertDiagonalEntriesIfMissing = true, RewardMatrixInformationStruct* rewardMatrixInformation = nullptr);
|
|
|
|
std::shared_ptr<storm::storage::SparseMatrix<double>> getMatrix() {
|
|
return this->matrix;
|
|
}
|
|
|
|
private:
|
|
std::shared_ptr<storm::storage::SparseMatrix<double>> matrix;
|
|
|
|
uint_fast64_t firstPass(char* buf, uint_fast64_t &maxnode, RewardMatrixInformationStruct* rewardMatrixInformation);
|
|
|
|
};
|
|
|
|
} // namespace parser
|
|
} // namespace storm
|
|
|
|
#endif /* STORM_PARSER_TRAPARSER_H_ */
|