perf: use copy=False when reversing graphs

Author: dsanders11

count_reachable_roots.py

@@ -41,7 +41,7 @@ def count_reachable_roots(
     target_node = files.index(target)
 
     reachable_nodes = set(
-        [files[idx] for idx in nx.dfs_postorder_nodes(DG.reverse(), source=target_node) if idx != target_node]
+        [files[idx] for idx in nx.dfs_postorder_nodes(DG.reverse(False), source=target_node) if idx != target_node]
     )
 
     reachable_roots = set(include_analysis["roots"]).intersection(reachable_nodes)

cut_header.py

@@ -107,7 +107,7 @@ def create_include_graph(
             DG[edge[0]][edge[1]]["capacity"] = float("inf")
 
     # Remove everything in the graph that's not reachable from the target to speed up analysis
-    reachable_nodes = set(nx.dfs_postorder_nodes(DG.reverse(), source=files.index(target)))
+    reachable_nodes = set(nx.dfs_postorder_nodes(DG.reverse(False), source=files.index(target)))
     DG.remove_nodes_from([idx for idx in list(DG.nodes()) if idx not in reachable_nodes])
 
     return DG
@@ -238,7 +238,7 @@ def compute_top_indirect_cuts(
     DG2.add_node(PSEUDO_SOURCE)
 
     # Find reachable roots
-    reachable_nodes = set(files[idx] for idx in nx.dfs_postorder_nodes(DG2.reverse(), source=target_idx))
+    reachable_nodes = set(files[idx] for idx in nx.dfs_postorder_nodes(DG2.reverse(False), source=target_idx))
     reachable_roots = [
         root
         for root in include_analysis["roots"]
@@ -445,7 +445,7 @@ def compute_doms_to_target(include_analysis: IncludeAnalysisOutput, DG: nx.DiGra
     target_idx = files.index(target)
 
     # Find reachable roots
-    reachable_nodes = set(files[idx] for idx in nx.dfs_postorder_nodes(DG2.reverse(), source=target_idx))
+    reachable_nodes = set(files[idx] for idx in nx.dfs_postorder_nodes(DG2.reverse(False), source=target_idx))
     roots = [
         root
         for root in include_analysis["roots"]