From 3482e3b2d531cff0b03084ae22fa4377c26a0254 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Maximilian=20Ke=C3=9Fler?= Date: Sun, 5 Nov 2023 12:52:03 +0100 Subject: [PATCH] separate src folder --- edmonds.cpp => src/edmonds.cpp | 0 edmonds.h => src/edmonds.h | 0 example.cpp => src/example.cpp | 0 graph.cpp => src/graph.cpp | 1 + graph.hpp => src/graph.hpp | 1 + 5 files changed, 2 insertions(+) rename edmonds.cpp => src/edmonds.cpp (100%) rename edmonds.h => src/edmonds.h (100%) rename example.cpp => src/example.cpp (100%) rename graph.cpp => src/graph.cpp (99%) rename graph.hpp => src/graph.hpp (99%) diff --git a/edmonds.cpp b/src/edmonds.cpp similarity index 100% rename from edmonds.cpp rename to src/edmonds.cpp diff --git a/edmonds.h b/src/edmonds.h similarity index 100% rename from edmonds.h rename to src/edmonds.h diff --git a/example.cpp b/src/example.cpp similarity index 100% rename from example.cpp rename to src/example.cpp diff --git a/graph.cpp b/src/graph.cpp similarity index 99% rename from graph.cpp rename to src/graph.cpp index 9cf3fa2..59dbee9 100644 --- a/graph.cpp +++ b/src/graph.cpp @@ -200,6 +200,7 @@ void Graph::reset_forest() for(auto & node : _nodes) { node.ear_or_root_neighbor = cur_id; node.root_of_ear_component = cur_id; + node.scanned = false; // Note that we do not change the matching itself here ++cur_id; } diff --git a/graph.hpp b/src/graph.hpp similarity index 99% rename from graph.hpp rename to src/graph.hpp index a287f54..2d8d1b1 100644 --- a/graph.hpp +++ b/src/graph.hpp @@ -95,6 +95,7 @@ public: NodeId matched_neighbor {invalid_node_id}; NodeId ear_or_root_neighbor {invalid_node_id}; NodeId root_of_ear_component {invalid_node_id}; + bool scanned; private: // This allows each Graph to access private members of this class,