Merge pull request #6160 from johnfxgalea/add-for-each-predecessor

Add for_each_predecessor() to grapht

Author: tautschnig

src/util/graph.h

@@ -315,6 +315,9 @@ class grapht
   std::vector<node_indext> get_predecessors(const node_indext &n) const;
   std::vector<node_indext> get_successors(const node_indext &n) const;
   void output_dot(std::ostream &out) const;
+  void for_each_predecessor(
+    const node_indext &n,
+    std::function<void(const node_indext &)> f) const;
   void for_each_successor(
     const node_indext &n,
     std::function<void(const node_indext &)> f) const;
@@ -961,6 +964,17 @@ grapht<N>::get_successors(const node_indext &n) const
   return result;
 }
 
+template <class N>
+void grapht<N>::for_each_predecessor(
+  const node_indext &n,
+  std::function<void(const node_indext &)> f) const
+{
+  std::for_each(
+    nodes[n].in.begin(),
+    nodes[n].in.end(),
+    [&](const std::pair<node_indext, edget> &edge) { f(edge.first); });
+}
+
 template <class N>
 void grapht<N>::for_each_successor(
   const node_indext &n,

unit/util/graph.cpp

@@ -329,6 +329,17 @@ SCENARIO("predecessors-successors-graph", "[core][util][graph]")
       REQUIRE(graph.get_successors(indices[0]).size() == 1);
       REQUIRE(graph.get_predecessors(indices[1]).size() == 1);
       REQUIRE(graph.get_successors(indices[1]).size() == 0);
+
+      int count = 0;
+      graph.for_each_predecessor(
+        indices[1], [&](const simple_grapht::node_indext &n) { count++; });
+      REQUIRE(count == 1);
+
+      // Refresh counter.
+      count = 0;
+      graph.for_each_successor(
+        indices[1], [&](const simple_grapht::node_indext &n) { count++; });
+      REQUIRE(count == 0);
     }
   }
 }