Fix t_rr_graph_storage::sort_edges warning

Author: AmirhosseinPoolad

libs/librrgraph/src/base/rr_graph_storage.cpp

@@ -168,10 +168,6 @@ size_t t_rr_graph_storage::count_rr_switches(const std::vector<t_arch_switch_inf
     // Sort by destination node to collect per node/per switch fan in values
     // This sort is safe to do because partition_edges() has not been invoked yet.
     sort_edges(edge_compare_dest_node(*this));
-    // std::stable_sort(
-    //     edge_sort_iterator(this, 0),
-    //     edge_sort_iterator(this, edge_dest_node_.size()),
-    //     edge_compare_dest_node());
 
     // Collect the fan-in per switch type for each node in the graph
     // Record the unique switch type/fanin combinations

libs/librrgraph/src/base/rr_graph_storage.h

@@ -828,31 +828,25 @@ class t_rr_graph_storage {
         // That would make the sorting in-place and much more efficient.
 
         size_t num_edges = edge_src_node_.size();
-        std::vector<size_t> edge_indices;
-        edge_indices.resize(num_edges);
+        std::vector<size_t> edge_indices(num_edges, 0);
 
         std::iota(edge_indices.begin(), edge_indices.end(), 0);
 
         std::ranges::stable_sort(edge_indices, comparison_function);
 
 
 
-        vtr::vector<RREdgeId, RRNodeId> new_edge_src_node_;
-        vtr::vector<RREdgeId, RRNodeId> new_edge_dest_node_;
-        vtr::vector<RREdgeId, short> new_edge_switch_;
-        vtr::vector<RREdgeId, bool> new_edge_remapped_;
-
-        new_edge_src_node_.resize(num_edges);
-        new_edge_dest_node_.resize(num_edges);
-        new_edge_switch_.resize(num_edges);
-        new_edge_remapped_.resize(num_edges);
+        vtr::vector<RREdgeId, RRNodeId> new_edge_src_node_(num_edges, RRNodeId::INVALID());
+        vtr::vector<RREdgeId, RRNodeId> new_edge_dest_node_(num_edges, RRNodeId::INVALID());
+        vtr::vector<RREdgeId, short> new_edge_switch_(num_edges, LIBRRGRAPH_UNDEFINED_VAL);
+        vtr::vector<RREdgeId, bool> new_edge_remapped_(num_edges, false);
 
         size_t new_index = 0;
         for (size_t edge_index : edge_indices) {
             new_edge_src_node_[RREdgeId(new_index)] = edge_src_node_[RREdgeId(edge_index)];
             new_edge_dest_node_[RREdgeId(new_index)] = edge_dest_node_[RREdgeId(edge_index)];
-            new_edge_switch_[RREdgeId(new_index)] = new_edge_switch_[RREdgeId(edge_index)];
-            new_edge_remapped_[RREdgeId(new_index)] = new_edge_remapped_[RREdgeId(edge_index)];
+            new_edge_switch_[RREdgeId(new_index)] = edge_switch_[RREdgeId(edge_index)];
+            new_edge_remapped_[RREdgeId(new_index)] = edge_remapped_[RREdgeId(edge_index)];
             new_index++;
         }
 
@@ -907,8 +901,6 @@ class t_rr_graph_storage {
     }
 
   private:
-    friend struct edge_swapper;
-    friend class edge_sort_iterator;
     friend class edge_compare_dest_node;
     friend class edge_compare_src_node_and_configurable_first;