comment / clarification

src/utility/shortestPaths.cpp

@@ -113,7 +113,7 @@ namespace storm {
 
             template <typename T>
             void ShortestPathsGenerator<T>::computePredecessors() {
-                assert(numStates - 1 == transitionMatrix.getRowCount());
+                assert(transitionMatrix.hasTrivialRowGrouping());
 
                 // one more for meta-target
                 graphPredecessors.resize(numStates);

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;

test/functional/utility/KSPTest.cpp

@@ -112,10 +112,3 @@ TEST(KSPTest, kspPathAsList) {
 
     EXPECT_EQ(list, reference);
 }
-
-
-//----------------------------
-// v---- PLAYGROUND ----v
-//----------------------------
-
-// (empty)