Updated to latest version of DirectedGraph

grame-cncm · Jan 20, 2025 · 7e037b6 · 7e037b6
1 parent f20c15a
commit 7e037b6
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/compiler/DirectedGraph/DirectedGraphAlgorythm.hh b/compiler/DirectedGraph/DirectedGraphAlgorythm.hh
@@ -98,7 +98,7 @@ class Tarjan {
     explicit Tarjan(const digraph<N>& g) : fGraph(g)
     {
         for (const auto& n : fGraph.nodes()) {
-            if (!fAux.contains(n)) {
+            if (fAux.find(n) == fAux.end()) {
                 visit(n);
             }
         }

diff --git a/compiler/DirectedGraph/Schedule.hh b/compiler/DirectedGraph/Schedule.hh
@@ -120,7 +120,7 @@ inline schedule<N> dfschedule(const digraph<N>& G)
 
     // recursive deep first visit (pseudo local function using a lambda)
     std::function<void(const N&)> dfvisit = [&](const N& n) {
-        if (!V.contains(n)) {
+        if (V.find(n) == V.end()) {
             V.insert(n);
             for (const auto& p : G.destinations(n)) {
                 dfvisit(p.first);