[lib][rr_graph] remove data structures related to partioning edges from remove nodes

Author: amin1377

libs/librrgraph/src/base/rr_graph_storage.cpp

@@ -700,6 +700,7 @@ void t_rr_graph_storage::set_virtual_clock_network_root_idx(RRNodeId virtual_clo
 }
 
 void t_rr_graph_storage::remove_nodes(const std::vector<RRNodeId>& nodes) {
+    VTR_ASSERT(!edges_read_);
     // To remove the nodes, we first sort them in ascending order. This makes it easy 
     // to calculate the offset by which other node IDs need to be adjusted. 
     // For example, after sorting the nodes to be removed, if a node ID falls between 
@@ -720,8 +721,6 @@ void t_rr_graph_storage::remove_nodes(const std::vector<RRNodeId>& nodes) {
             RRNodeId new_node = RRNodeId(j-(i+1));
             node_storage_[new_node] = node_storage_[old_node];
             node_ptc_[new_node] = node_ptc_[old_node];
-            node_first_edge_[new_node] = node_first_edge_[old_node];
-            node_fan_in_[new_node] = node_fan_in_[old_node];
             node_layer_[new_node] = node_layer_[old_node];
             node_name_[new_node] = node_name_[old_node];
             if (is_tileable_) {
@@ -737,8 +736,6 @@ void t_rr_graph_storage::remove_nodes(const std::vector<RRNodeId>& nodes) {
     VTR_ASSERT(num_nodes_to_remove <= node_storage_.size());
     node_storage_.erase(node_storage_.end()-num_nodes_to_remove, node_storage_.end());
     node_ptc_.erase(node_ptc_.end()-num_nodes_to_remove, node_ptc_.end());
-    node_first_edge_.erase(node_first_edge_.end()-num_nodes_to_remove, node_first_edge_.end());
-    node_fan_in_.erase(node_fan_in_.end()-num_nodes_to_remove, node_fan_in_.end());
     node_layer_.erase(node_layer_.end()-num_nodes_to_remove, node_layer_.end());
     for (size_t node_index = node_name_.size()-num_nodes_to_remove; node_index < node_name_.size(); ++node_index) {
         RRNodeId node = RRNodeId(node_index);

libs/librrgraph/src/base/rr_graph_storage.h

@@ -739,7 +739,8 @@ class t_rr_graph_storage {
 
     /**
      * @brief Removes a given list of RRNodes from the RR Graph
-     * This method should be called after partition_edges has been called.
+     * This method should be called before partition_edges has been called.
+     * If init_fan_in has been called, you need to call it again after removing the nodes.
      * @note This a very expensive method, so should be called only when necessary. It is better
      * to not add nodes in the first place, instead of relying on this method to remove nodes.
      *