can analyze reachability for a task chain

vovatrykoz · Nov 13, 2024 · b2c1590 · b2c1590
1 parent b947f7d
commit b2c1590
Show file tree

Hide file tree

Showing 2 changed files with 10 additions and 6 deletions.
diff --git a/include/Task.h b/include/Task.h
@@ -19,12 +19,12 @@ struct TaskInstance {
 };
 
 struct TaskInstancePair {
-    TaskInstance currentInstance;
+    TaskInstance instance;
     TaskInstance nextInstance;
 
     TaskInstancePair(const TaskInstance& currentInstance,
                      const TaskInstance& nextInstance)
-        : currentInstance(currentInstance), nextInstance(nextInstance) {}
+        : instance(currentInstance), nextInstance(nextInstance) {}
 };
 
 #endif
diff --git a/source/MathFramework.cpp b/source/MathFramework.cpp
@@ -63,16 +63,20 @@ bool MathFramework::reach(const TaskInstance& currentWriterTaskInstance,
 }
 
 bool MathFramework::pathReach(const std::vector<TaskInstancePair>& timedPath) {
-    if(timedPath.empty()) {
+    if (timedPath.empty()) {
         return false;
     }
 
-    if(timedPath.size() == 1) {
+    if (timedPath.size() == 1) {
         return true;
     }
 
-    for(int i = 0; i < timedPath.size() - 2; i++) {
-
+    for (int i = 0; i < timedPath.size() - 2; i++) {
+        if (!reach(timedPath[i].instance,
+                   timedPath[i + 1].instance,
+                   timedPath[i].nextInstance)) {
+            return false;
+        }
     }
 
     return true;