Fix: Reduce variable scope to resolve Codacy warnings (totalCost, added, found_e)

Author: Mohit242-bit

include/contraction/linearContraction.hpp

@@ -107,10 +107,9 @@ class Pgr_linear {
          pgassert(v != w);
          pgassert(u != w);
 
-         E e, f;
-         bool found_e = false, found_f = false;
-
          if (graph.is_directed()) {
+             E e, f;
+             bool found_e = false, found_f = false;
              /*
               *  u --> v --> w
               */

src/cpp_common/undirectedNoCostBG.cpp

@@ -49,9 +49,9 @@ UndirectedNoCostsBG::UndirectedNoCostsBG(const std::vector<Edge_bool_t> &edges)
     for (const auto edge : edges) {
         V v1 = get_boost_vertex(edge.source);
         V v2 = get_boost_vertex(edge.target);
-        E e;
-        bool added = false;
         if (edge.going) {
+            E e;
+            bool added = false;
             boost::tie(e, added) = boost::add_edge(v1, v2, graph);
             if (added) E_to_id.insert(std::pair<E, int64_t>(e, edge.id));
         }

src/trsp/trspHandler.cpp

@@ -232,8 +232,6 @@ void TrspHandler::explore(
         int64_t cur_node,
         const EdgeInfo cur_edge,
         bool isStart) {
-    double totalCost = 0.0;
-
     auto vecIndex = cur_edge.get_idx(isStart);
 
     for (const auto &index : vecIndex) {
@@ -244,7 +242,7 @@ void TrspHandler::explore(
                 edge, isStart);
 
         if ((edge.startNode() == cur_node) && (edge.cost() >= 0.0)) {
-            totalCost = get_tot_cost(
+            double totalCost = get_tot_cost(
                     edge.cost() + extra_cost,
                     cur_edge.idx(),
                     isStart);
@@ -260,7 +258,7 @@ void TrspHandler::explore(
         }
 
        if ((edge.endNode() == cur_node) && (edge.r_cost() >= 0.0)) {
-            totalCost = get_tot_cost(
+            double totalCost = get_tot_cost(
                     edge.r_cost() + extra_cost,
                     cur_edge.idx(),
                     isStart);