Record number of crossing edges between Inner and Outer sweep

SSoelvsten · Dec 20, 2023 · a55d35a · a55d35a
1 parent 0f7f374
commit a55d35a
Show file tree

Hide file tree

Showing 3 changed files with 41 additions and 2 deletions.
diff --git a/src/adiar/internal/algorithms/nested_sweeping.h b/src/adiar/internal/algorithms/nested_sweeping.h
@@ -1053,8 +1053,14 @@ namespace adiar::internal
         void push(const value_type& v)
         {
           if (v.source().is_flagged()) {
+#ifdef ADIAR_STATS
+            stats.inner_up.outer_arcs += 1;
+#endif
             _outer_pq.push(arc(unflag(v.source()), v.target()));
           } else {
+#ifdef ADIAR_STATS
+            stats.inner_up.inner_arcs += 1;
+#endif
             _inner_pq.push(v);
           }
         }

diff --git a/src/adiar/statistics.cpp b/src/adiar/statistics.cpp
@@ -697,8 +697,6 @@ namespace adiar
 
   void __printstat_nested_sweeping(std::ostream &o)
   {
-    // TODO: Merge code duplication with `__printstat_reduce(...)`
-
     const uintwide total_runs = internal::nested_sweeping::stats.skips
                               + internal::nested_sweeping::stats.runs;
 
@@ -785,6 +783,31 @@ namespace adiar
       o << indent << bold_on << "inner down sweep" << bold_off << endl;
       indent_level++;
 
+      const uintwide total_arcs = internal::nested_sweeping::stats.inner_up.outer_arcs
+                                + internal::nested_sweeping::stats.inner_up.inner_arcs;
+
+      o << indent << bold_on << label << "arc types" << bold_off
+        << total_arcs
+        << endl;
+
+      indent_level++;
+
+      o << indent << label << "outer"
+        << internal::nested_sweeping::stats.inner_up.outer_arcs
+        << " = "  << internal::percent_frac(internal::nested_sweeping::stats.inner_up.outer_arcs,
+                                            total_arcs) << percent
+        << endl;
+
+      o << indent << label << "inner"
+        << internal::nested_sweeping::stats.inner_up.inner_arcs
+        << " = "  << internal::percent_frac(internal::nested_sweeping::stats.inner_up.inner_arcs,
+                                            total_arcs) << percent
+        << endl;
+
+      indent_level--;
+
+      o << indent << endl;
+
       o << indent << bold_on << "root requests" << bold_off << endl;
 
       indent_level++;

diff --git a/src/adiar/statistics.h b/src/adiar/statistics.h
@@ -593,6 +593,16 @@ namespace adiar
       //////////////////////////////////////////////////////////////////////////
       struct inner_up_t : public reduce_t
       {
+        //////////////////////////////////////////////////////////////////////
+        /// \brief Number of arcs within inner sweep.
+        //////////////////////////////////////////////////////////////////////
+        uintwide inner_arcs = 0;
+
+        //////////////////////////////////////////////////////////////////////
+        /// \brief Number of arcs within outer sweep.
+        //////////////////////////////////////////////////////////////////////
+        uintwide outer_arcs = 0;
+
         ////////////////////////////////////////////////////////////////////////
         /// \brief Number of levels reduced canonically.
         ////////////////////////////////////////////////////////////////////////