Fix t_rr_graph_storage::sort_edges warning

Author: AmirhosseinPoolad

libs/librrgraph/src/base/rr_graph_storage.h

@@ -828,24 +828,18 @@ 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) {