From 178b72ba909049d1a5b064c9cd6575afd178561f Mon Sep 17 00:00:00 2001 From: casperlamboo Date: Fri, 5 Jan 2024 23:32:38 +0000 Subject: [PATCH] Applied clang-format. --- include/PathOrderOptimizer.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/include/PathOrderOptimizer.h b/include/PathOrderOptimizer.h index 998c67eab1..4b71b19a77 100644 --- a/include/PathOrderOptimizer.h +++ b/include/PathOrderOptimizer.h @@ -373,7 +373,7 @@ class PathOrderOptimizer { roots.erase(v); leaves.erase(u); - num_incoming_edges.find(v)->second ++; + num_incoming_edges.find(v)->second++; } // We used a shared visited set between runs of dfs. This is for the case when we reverse the ordering tree. @@ -395,7 +395,7 @@ class PathOrderOptimizer // from an arbitrary leaf we might encounter a junction. All paths from the other leaf-side(s) of the junction // should be printed before continuing the junctions. Only once every branch of the junction has been ordered // we can continue with the junction itself. - num_incoming_edges.find(neighbour)->second --; + num_incoming_edges.find(neighbour)->second--; if (num_incoming_edges.at(neighbour) == 0) { candidates.insert(neighbour);