From 71a54a842c71410ab13bb89848404f4445ccc298 Mon Sep 17 00:00:00 2001 From: Tom Janson Date: Wed, 23 Nov 2016 16:44:49 +0100 Subject: [PATCH] comment / clarification --- src/utility/shortestPaths.cpp | 2 +- src/utility/shortestPaths.h | 4 ++-- test/functional/utility/KSPTest.cpp | 7 ------- 3 files changed, 3 insertions(+), 10 deletions(-) diff --git a/src/utility/shortestPaths.cpp b/src/utility/shortestPaths.cpp index 2a7c21285..7912f15ee 100644 --- a/src/utility/shortestPaths.cpp +++ b/src/utility/shortestPaths.cpp @@ -113,7 +113,7 @@ namespace storm { template void ShortestPathsGenerator::computePredecessors() { - assert(numStates - 1 == transitionMatrix.getRowCount()); + assert(transitionMatrix.hasTrivialRowGrouping()); // one more for meta-target graphPredecessors.resize(numStates); diff --git a/src/utility/shortestPaths.h b/src/utility/shortestPaths.h index 2ffdcc13a..c34439401 100644 --- a/src/utility/shortestPaths.h +++ b/src/utility/shortestPaths.h @@ -93,7 +93,7 @@ namespace storm { /*! * Returns the states that occur in the KSP. - * For a path-traversal (in order and with duplicates), see `getKSP`. + * For a path-traversal (in order and with duplicates), see `getPathAsList`. * Computes KSP if not yet computed. * @throws std::invalid_argument if no such k-shortest path exists */ @@ -108,7 +108,7 @@ namespace storm { private: - Matrix const& transitionMatrix; // FIXME: store reference instead (?) + Matrix const& transitionMatrix; state_t numStates; // includes meta-target, i.e. states in model + 1 state_t metaTarget; BitVector initialStates; diff --git a/test/functional/utility/KSPTest.cpp b/test/functional/utility/KSPTest.cpp index 2389f3f1c..ef1e8a7b5 100644 --- a/test/functional/utility/KSPTest.cpp +++ b/test/functional/utility/KSPTest.cpp @@ -112,10 +112,3 @@ TEST(KSPTest, kspPathAsList) { EXPECT_EQ(list, reference); } - - -//---------------------------- -// v---- PLAYGROUND ----v -//---------------------------- - -// (empty)