Add first unit tests for topological sorting

[simgrid.git] / src / mc / explo / udpor / History.hpp

diff --git a/src/mc/explo/udpor/History.hpp b/src/mc/explo/udpor/History.hpp
index 4815496e9a1debbbea237840d44da1daa312d9db..e66742417577bcf7a6b68126625ca6593b8ffb40 100644 (file)
--- a/src/mc/explo/udpor/History.hpp
+++ b/src/mc/explo/udpor/History.hpp
@@ -85,6 +85,14 @@ public:
    * dependency graph for all events in this history
    */
   EventSet get_all_events() const;
+
+  /**
+   * @brief Computes all events in the history described by this instance
+   * which are maximal (intuitively, those events which cause no others
+   * or are the "most recent")
+   */
+  EventSet get_all_maximal_events() const;
+
   EventSet get_event_diff_with(const Configuration& config) const;
 
 private:
@@ -113,8 +121,15 @@ private:
     Iterator(const EventSet& initial_events, optional_configuration config = std::nullopt);
 
   private:
+    /// @brief Points in the graph from where to continue the search
     EventSet frontier;
+
+    /// @brief What the iterator currently believes to be the
+    /// entire history of the events in the graph it traverses
     EventSet current_history = EventSet();
+
+    /// @brief What the iterator currently believes
+    EventSet maximal_events;
     optional_configuration configuration;
     friend History;
   };